/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 14:36:42,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 14:36:42,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 14:36:42,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 14:36:42,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 14:36:42,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 14:36:42,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 14:36:42,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 14:36:42,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 14:36:42,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 14:36:42,786 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 14:36:42,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 14:36:42,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 14:36:42,788 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 14:36:42,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 14:36:42,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 14:36:42,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 14:36:42,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 14:36:42,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 14:36:42,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 14:36:42,789 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 14:36:42,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 14:36:42,790 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 14:36:42,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 14:36:42,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 14:36:42,791 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 14:36:42,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 14:36:42,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 14:36:42,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 14:36:42,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 14:36:42,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 14:36:42,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 14:36:42,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 14:36:42,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 14:36:42,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 14:36:42,794 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 14:36:43,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 14:36:43,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 14:36:43,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 14:36:43,103 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 14:36:43,103 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 14:36:43,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2023-08-24 14:36:44,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 14:36:44,478 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 14:36:44,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2023-08-24 14:36:44,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4a316ee2/1f198558ee3b4605bfe61de1601fab5f/FLAG445d00bee [2023-08-24 14:36:44,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4a316ee2/1f198558ee3b4605bfe61de1601fab5f [2023-08-24 14:36:44,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 14:36:44,504 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 14:36:44,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 14:36:44,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 14:36:44,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 14:36:44,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181919d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44, skipping insertion in model container [2023-08-24 14:36:44,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,534 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 14:36:44,664 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c[4225,4238] [2023-08-24 14:36:44,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 14:36:44,678 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 14:36:44,702 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c[4225,4238] [2023-08-24 14:36:44,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 14:36:44,713 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 14:36:44,713 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 14:36:44,718 INFO L206 MainTranslator]: Completed translation [2023-08-24 14:36:44,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44 WrapperNode [2023-08-24 14:36:44,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 14:36:44,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 14:36:44,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 14:36:44,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 14:36:44,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,767 INFO L138 Inliner]: procedures = 29, calls = 88, calls flagged for inlining = 22, calls inlined = 32, statements flattened = 404 [2023-08-24 14:36:44,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 14:36:44,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 14:36:44,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 14:36:44,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 14:36:44,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 14:36:44,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 14:36:44,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 14:36:44,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 14:36:44,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (1/1) ... [2023-08-24 14:36:44,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 14:36:44,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:36:44,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 14:36:44,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 14:36:44,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 14:36:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 14:36:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 14:36:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 14:36:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 14:36:44,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 14:36:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 14:36:44,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 14:36:44,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 14:36:44,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 14:36:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 14:36:44,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 14:36:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 14:36:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-24 14:36:44,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-24 14:36:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-24 14:36:44,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-24 14:36:44,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 14:36:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 14:36:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 14:36:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 14:36:44,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 14:36:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 14:36:44,890 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 14:36:45,000 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 14:36:45,001 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 14:36:45,539 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 14:36:45,727 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 14:36:45,727 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-24 14:36:45,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 02:36:45 BoogieIcfgContainer [2023-08-24 14:36:45,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 14:36:45,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 14:36:45,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 14:36:45,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 14:36:45,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 02:36:44" (1/3) ... [2023-08-24 14:36:45,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac30ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 02:36:45, skipping insertion in model container [2023-08-24 14:36:45,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:36:44" (2/3) ... [2023-08-24 14:36:45,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac30ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 02:36:45, skipping insertion in model container [2023-08-24 14:36:45,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 02:36:45" (3/3) ... [2023-08-24 14:36:45,746 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2023-08-24 14:36:45,760 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 14:36:45,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 14:36:45,760 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 14:36:45,930 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-08-24 14:36:45,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 311 transitions, 694 flow [2023-08-24 14:36:46,053 INFO L124 PetriNetUnfolderBase]: 21/267 cut-off events. [2023-08-24 14:36:46,054 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 14:36:46,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 267 events. 21/267 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 308 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 229. Up to 3 conditions per place. [2023-08-24 14:36:46,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 311 transitions, 694 flow [2023-08-24 14:36:46,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 259 transitions, 566 flow [2023-08-24 14:36:46,068 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 14:36:46,076 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 257 places, 259 transitions, 566 flow [2023-08-24 14:36:46,078 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 257 places, 259 transitions, 566 flow [2023-08-24 14:36:46,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 259 transitions, 566 flow [2023-08-24 14:36:46,128 INFO L124 PetriNetUnfolderBase]: 21/259 cut-off events. [2023-08-24 14:36:46,128 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 14:36:46,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 259 events. 21/259 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 297 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 229. Up to 3 conditions per place. [2023-08-24 14:36:46,135 INFO L119 LiptonReduction]: Number of co-enabled transitions 8992 [2023-08-24 14:36:53,955 INFO L134 LiptonReduction]: Checked pairs total: 32361 [2023-08-24 14:36:53,956 INFO L136 LiptonReduction]: Total number of compositions: 242 [2023-08-24 14:36:53,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 14:36:53,972 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@40f41b74, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 14:36:53,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-08-24 14:36:53,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 14:36:53,983 INFO L124 PetriNetUnfolderBase]: 9/60 cut-off events. [2023-08-24 14:36:53,984 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 14:36:53,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:36:53,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:36:53,985 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:36:53,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:36:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1830445934, now seen corresponding path program 1 times [2023-08-24 14:36:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:36:53,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311903493] [2023-08-24 14:36:53,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:36:53,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:36:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:36:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:36:54,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:36:54,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311903493] [2023-08-24 14:36:54,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311903493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 14:36:54,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 14:36:54,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 14:36:54,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960957676] [2023-08-24 14:36:54,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 14:36:54,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 14:36:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:36:54,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 14:36:54,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 14:36:54,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 557 [2023-08-24 14:36:54,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 248.5) internal successors, (994), 4 states have internal predecessors, (994), 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) [2023-08-24 14:36:54,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:36:54,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 557 [2023-08-24 14:36:54,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:36:55,653 INFO L124 PetriNetUnfolderBase]: 4669/6729 cut-off events. [2023-08-24 14:36:55,654 INFO L125 PetriNetUnfolderBase]: For 1689/1689 co-relation queries the response was YES. [2023-08-24 14:36:55,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14663 conditions, 6729 events. 4669/6729 cut-off events. For 1689/1689 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 31703 event pairs, 3014 based on Foata normal form. 36/4961 useless extension candidates. Maximal degree in co-relation 7761. Up to 3367 conditions per place. [2023-08-24 14:36:55,687 INFO L140 encePairwiseOnDemand]: 551/557 looper letters, 38 selfloop transitions, 2 changer transitions 31/93 dead transitions. [2023-08-24 14:36:55,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 93 transitions, 421 flow [2023-08-24 14:36:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 14:36:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 14:36:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1038 transitions. [2023-08-24 14:36:55,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4658886894075404 [2023-08-24 14:36:55,702 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1038 transitions. [2023-08-24 14:36:55,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1038 transitions. [2023-08-24 14:36:55,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:36:55,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1038 transitions. [2023-08-24 14:36:55,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 259.5) internal successors, (1038), 4 states have internal predecessors, (1038), 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) [2023-08-24 14:36:55,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 557.0) internal successors, (2785), 5 states have internal predecessors, (2785), 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) [2023-08-24 14:36:55,719 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 557.0) internal successors, (2785), 5 states have internal predecessors, (2785), 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) [2023-08-24 14:36:55,721 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 170 flow. Second operand 4 states and 1038 transitions. [2023-08-24 14:36:55,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 93 transitions, 421 flow [2023-08-24 14:36:55,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 359 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-24 14:36:55,759 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 156 flow [2023-08-24 14:36:55,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2023-08-24 14:36:55,764 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -7 predicate places. [2023-08-24 14:36:55,764 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 156 flow [2023-08-24 14:36:55,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 248.5) internal successors, (994), 4 states have internal predecessors, (994), 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) [2023-08-24 14:36:55,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:36:55,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:36:55,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 14:36:55,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:36:55,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:36:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash -347521073, now seen corresponding path program 1 times [2023-08-24 14:36:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:36:55,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733179235] [2023-08-24 14:36:55,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:36:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:36:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:36:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 14:36:56,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:36:56,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733179235] [2023-08-24 14:36:56,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733179235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 14:36:56,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 14:36:56,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 14:36:56,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501216359] [2023-08-24 14:36:56,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 14:36:56,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 14:36:56,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:36:56,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 14:36:56,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 14:36:56,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 557 [2023-08-24 14:36:56,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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) [2023-08-24 14:36:56,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:36:56,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 557 [2023-08-24 14:36:56,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:36:57,559 INFO L124 PetriNetUnfolderBase]: 7727/10406 cut-off events. [2023-08-24 14:36:57,559 INFO L125 PetriNetUnfolderBase]: For 1771/1815 co-relation queries the response was YES. [2023-08-24 14:36:57,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22255 conditions, 10406 events. 7727/10406 cut-off events. For 1771/1815 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 46359 event pairs, 2017 based on Foata normal form. 23/8382 useless extension candidates. Maximal degree in co-relation 22243. Up to 3712 conditions per place. [2023-08-24 14:36:57,615 INFO L140 encePairwiseOnDemand]: 548/557 looper letters, 111 selfloop transitions, 10 changer transitions 9/152 dead transitions. [2023-08-24 14:36:57,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 152 transitions, 651 flow [2023-08-24 14:36:57,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 14:36:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 14:36:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1636 transitions. [2023-08-24 14:36:57,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48952722920406944 [2023-08-24 14:36:57,620 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1636 transitions. [2023-08-24 14:36:57,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1636 transitions. [2023-08-24 14:36:57,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:36:57,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1636 transitions. [2023-08-24 14:36:57,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 272.6666666666667) internal successors, (1636), 6 states have internal predecessors, (1636), 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) [2023-08-24 14:36:57,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 557.0) internal successors, (3899), 7 states have internal predecessors, (3899), 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) [2023-08-24 14:36:57,633 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 557.0) internal successors, (3899), 7 states have internal predecessors, (3899), 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) [2023-08-24 14:36:57,635 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 156 flow. Second operand 6 states and 1636 transitions. [2023-08-24 14:36:57,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 152 transitions, 651 flow [2023-08-24 14:36:57,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 152 transitions, 639 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-24 14:36:57,653 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 221 flow [2023-08-24 14:36:57,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2023-08-24 14:36:57,654 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -1 predicate places. [2023-08-24 14:36:57,654 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 221 flow [2023-08-24 14:36:57,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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) [2023-08-24 14:36:57,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:36:57,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:36:57,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 14:36:57,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:36:57,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:36:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1663120577, now seen corresponding path program 2 times [2023-08-24 14:36:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:36:57,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779107612] [2023-08-24 14:36:57,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:36:57,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:36:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:36:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:36:58,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:36:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779107612] [2023-08-24 14:36:58,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779107612] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:36:58,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020087068] [2023-08-24 14:36:58,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 14:36:58,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:36:58,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:36:58,385 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) [2023-08-24 14:36:58,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 14:36:58,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 14:36:58,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 14:36:58,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-24 14:36:58,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:36:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 14:36:58,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 14:36:58,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020087068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 14:36:58,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 14:36:58,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2023-08-24 14:36:58,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367219968] [2023-08-24 14:36:58,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 14:36:58,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 14:36:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:36:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 14:36:58,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-08-24 14:36:58,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 557 [2023-08-24 14:36:58,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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) [2023-08-24 14:36:58,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:36:58,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 557 [2023-08-24 14:36:58,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:37:00,056 INFO L124 PetriNetUnfolderBase]: 7715/10496 cut-off events. [2023-08-24 14:37:00,056 INFO L125 PetriNetUnfolderBase]: For 5055/5075 co-relation queries the response was YES. [2023-08-24 14:37:00,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26142 conditions, 10496 events. 7715/10496 cut-off events. For 5055/5075 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 49108 event pairs, 1575 based on Foata normal form. 15/9657 useless extension candidates. Maximal degree in co-relation 26128. Up to 3712 conditions per place. [2023-08-24 14:37:00,110 INFO L140 encePairwiseOnDemand]: 548/557 looper letters, 106 selfloop transitions, 12 changer transitions 9/149 dead transitions. [2023-08-24 14:37:00,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 149 transitions, 696 flow [2023-08-24 14:37:00,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 14:37:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 14:37:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1631 transitions. [2023-08-24 14:37:00,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48803111909036506 [2023-08-24 14:37:00,116 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1631 transitions. [2023-08-24 14:37:00,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1631 transitions. [2023-08-24 14:37:00,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:37:00,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1631 transitions. [2023-08-24 14:37:00,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 271.8333333333333) internal successors, (1631), 6 states have internal predecessors, (1631), 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) [2023-08-24 14:37:00,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 557.0) internal successors, (3899), 7 states have internal predecessors, (3899), 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) [2023-08-24 14:37:00,127 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 557.0) internal successors, (3899), 7 states have internal predecessors, (3899), 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) [2023-08-24 14:37:00,127 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 221 flow. Second operand 6 states and 1631 transitions. [2023-08-24 14:37:00,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 149 transitions, 696 flow [2023-08-24 14:37:00,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 149 transitions, 684 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 14:37:00,138 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 266 flow [2023-08-24 14:37:00,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2023-08-24 14:37:00,139 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places. [2023-08-24 14:37:00,139 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 266 flow [2023-08-24 14:37:00,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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) [2023-08-24 14:37:00,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:37:00,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:37:00,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 14:37:00,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:37:00,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:37:00,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:37:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash 749729116, now seen corresponding path program 1 times [2023-08-24 14:37:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:37:00,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692354040] [2023-08-24 14:37:00,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:37:00,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:37:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:37:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:37:00,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:37:00,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692354040] [2023-08-24 14:37:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692354040] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:37:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467354621] [2023-08-24 14:37:00,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:37:00,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:37:00,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:37:00,688 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) [2023-08-24 14:37:00,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 14:37:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:37:00,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 14:37:00,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:37:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:37:00,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 14:37:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:37:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467354621] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 14:37:01,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 14:37:01,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-24 14:37:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577755218] [2023-08-24 14:37:01,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 14:37:01,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 14:37:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:37:01,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 14:37:01,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-24 14:37:01,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 557 [2023-08-24 14:37:01,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 266 flow. Second operand has 11 states, 11 states have (on average 245.54545454545453) internal successors, (2701), 11 states have internal predecessors, (2701), 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) [2023-08-24 14:37:01,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:37:01,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 557 [2023-08-24 14:37:01,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:37:02,805 INFO L124 PetriNetUnfolderBase]: 13636/19161 cut-off events. [2023-08-24 14:37:02,805 INFO L125 PetriNetUnfolderBase]: For 14803/14819 co-relation queries the response was YES. [2023-08-24 14:37:02,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48861 conditions, 19161 events. 13636/19161 cut-off events. For 14803/14819 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 102967 event pairs, 8879 based on Foata normal form. 1078/18598 useless extension candidates. Maximal degree in co-relation 48838. Up to 8662 conditions per place. [2023-08-24 14:37:02,896 INFO L140 encePairwiseOnDemand]: 551/557 looper letters, 105 selfloop transitions, 6 changer transitions 1/134 dead transitions. [2023-08-24 14:37:02,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 134 transitions, 725 flow [2023-08-24 14:37:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 14:37:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 14:37:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1529 transitions. [2023-08-24 14:37:02,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45751047277079593 [2023-08-24 14:37:02,901 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1529 transitions. [2023-08-24 14:37:02,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1529 transitions. [2023-08-24 14:37:02,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:37:02,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1529 transitions. [2023-08-24 14:37:02,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 254.83333333333334) internal successors, (1529), 6 states have internal predecessors, (1529), 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) [2023-08-24 14:37:02,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 557.0) internal successors, (3899), 7 states have internal predecessors, (3899), 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) [2023-08-24 14:37:02,911 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 557.0) internal successors, (3899), 7 states have internal predecessors, (3899), 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) [2023-08-24 14:37:02,911 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 266 flow. Second operand 6 states and 1529 transitions. [2023-08-24 14:37:02,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 134 transitions, 725 flow [2023-08-24 14:37:02,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 134 transitions, 699 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 14:37:02,959 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 316 flow [2023-08-24 14:37:02,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2023-08-24 14:37:02,960 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2023-08-24 14:37:02,960 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 316 flow [2023-08-24 14:37:02,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 245.54545454545453) internal successors, (2701), 11 states have internal predecessors, (2701), 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) [2023-08-24 14:37:02,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:37:02,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:37:02,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 14:37:03,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-24 14:37:03,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:37:03,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:37:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash -279254443, now seen corresponding path program 1 times [2023-08-24 14:37:03,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:37:03,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966584389] [2023-08-24 14:37:03,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:37:03,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:37:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:37:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:37:03,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:37:03,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966584389] [2023-08-24 14:37:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966584389] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:37:03,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893116121] [2023-08-24 14:37:03,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:37:03,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:37:03,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:37:03,621 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) [2023-08-24 14:37:03,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 14:37:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:37:03,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 14:37:03,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:37:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:37:03,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 14:37:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:37:03,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893116121] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 14:37:03,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 14:37:03,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-24 14:37:03,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419265580] [2023-08-24 14:37:03,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 14:37:03,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 14:37:03,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:37:03,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 14:37:03,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-24 14:37:03,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 557 [2023-08-24 14:37:03,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 316 flow. Second operand has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 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) [2023-08-24 14:37:03,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:37:03,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 557 [2023-08-24 14:37:03,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:37:05,240 INFO L124 PetriNetUnfolderBase]: 9494/13491 cut-off events. [2023-08-24 14:37:05,240 INFO L125 PetriNetUnfolderBase]: For 12385/12385 co-relation queries the response was YES. [2023-08-24 14:37:05,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34114 conditions, 13491 events. 9494/13491 cut-off events. For 12385/12385 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 70060 event pairs, 6113 based on Foata normal form. 418/12754 useless extension candidates. Maximal degree in co-relation 30958. Up to 8982 conditions per place. [2023-08-24 14:37:05,299 INFO L140 encePairwiseOnDemand]: 551/557 looper letters, 64 selfloop transitions, 5 changer transitions 31/122 dead transitions. [2023-08-24 14:37:05,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 122 transitions, 643 flow [2023-08-24 14:37:05,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 14:37:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 14:37:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1525 transitions. [2023-08-24 14:37:05,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45631358467983246 [2023-08-24 14:37:05,304 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1525 transitions. [2023-08-24 14:37:05,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1525 transitions. [2023-08-24 14:37:05,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:37:05,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1525 transitions. [2023-08-24 14:37:05,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 254.16666666666666) internal successors, (1525), 6 states have internal predecessors, (1525), 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) [2023-08-24 14:37:05,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 557.0) internal successors, (3899), 7 states have internal predecessors, (3899), 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) [2023-08-24 14:37:05,314 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 557.0) internal successors, (3899), 7 states have internal predecessors, (3899), 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) [2023-08-24 14:37:05,314 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 316 flow. Second operand 6 states and 1525 transitions. [2023-08-24 14:37:05,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 122 transitions, 643 flow [2023-08-24 14:37:05,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 122 transitions, 635 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-24 14:37:05,334 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 299 flow [2023-08-24 14:37:05,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2023-08-24 14:37:05,335 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 14 predicate places. [2023-08-24 14:37:05,335 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 299 flow [2023-08-24 14:37:05,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 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) [2023-08-24 14:37:05,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:37:05,337 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:37:05,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 14:37:05,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:37:05,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:37:05,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:37:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1388826123, now seen corresponding path program 2 times [2023-08-24 14:37:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:37:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899199117] [2023-08-24 14:37:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:37:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:37:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:37:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 14:37:05,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:37:05,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899199117] [2023-08-24 14:37:05,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899199117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 14:37:05,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 14:37:05,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 14:37:05,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268629576] [2023-08-24 14:37:05,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 14:37:05,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 14:37:05,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:37:05,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 14:37:05,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 14:37:05,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 557 [2023-08-24 14:37:05,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 74 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 257.4) internal successors, (1287), 5 states have internal predecessors, (1287), 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) [2023-08-24 14:37:05,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:37:05,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 557 [2023-08-24 14:37:05,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:37:07,610 INFO L124 PetriNetUnfolderBase]: 16069/21364 cut-off events. [2023-08-24 14:37:07,611 INFO L125 PetriNetUnfolderBase]: For 20948/21168 co-relation queries the response was YES. [2023-08-24 14:37:07,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57265 conditions, 21364 events. 16069/21364 cut-off events. For 20948/21168 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 102829 event pairs, 4425 based on Foata normal form. 186/19824 useless extension candidates. Maximal degree in co-relation 57227. Up to 7212 conditions per place. [2023-08-24 14:37:07,725 INFO L140 encePairwiseOnDemand]: 551/557 looper letters, 100 selfloop transitions, 17 changer transitions 2/141 dead transitions. [2023-08-24 14:37:07,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 141 transitions, 758 flow [2023-08-24 14:37:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 14:37:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 14:37:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1109 transitions. [2023-08-24 14:37:07,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49775583482944347 [2023-08-24 14:37:07,729 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1109 transitions. [2023-08-24 14:37:07,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1109 transitions. [2023-08-24 14:37:07,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:37:07,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1109 transitions. [2023-08-24 14:37:07,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 277.25) internal successors, (1109), 4 states have internal predecessors, (1109), 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) [2023-08-24 14:37:07,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 557.0) internal successors, (2785), 5 states have internal predecessors, (2785), 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) [2023-08-24 14:37:07,735 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 557.0) internal successors, (2785), 5 states have internal predecessors, (2785), 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) [2023-08-24 14:37:07,735 INFO L175 Difference]: Start difference. First operand has 85 places, 74 transitions, 299 flow. Second operand 4 states and 1109 transitions. [2023-08-24 14:37:07,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 141 transitions, 758 flow [2023-08-24 14:37:07,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 141 transitions, 709 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-08-24 14:37:07,853 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 383 flow [2023-08-24 14:37:07,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=383, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2023-08-24 14:37:07,853 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places. [2023-08-24 14:37:07,854 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 383 flow [2023-08-24 14:37:07,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 257.4) internal successors, (1287), 5 states have internal predecessors, (1287), 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) [2023-08-24 14:37:07,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:37:07,854 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:37:07,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 14:37:07,855 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:37:07,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:37:07,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1485394170, now seen corresponding path program 2 times [2023-08-24 14:37:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:37:07,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273646231] [2023-08-24 14:37:07,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:37:07,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:37:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:37:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 14:37:08,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:37:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273646231] [2023-08-24 14:37:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273646231] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:37:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88240404] [2023-08-24 14:37:08,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 14:37:08,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:37:08,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:37:08,093 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) [2023-08-24 14:37:08,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 14:37:08,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 14:37:08,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 14:37:08,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 14:37:08,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:37:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 14:37:08,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 14:37:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 14:37:08,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88240404] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 14:37:08,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 14:37:08,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 12 [2023-08-24 14:37:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582215433] [2023-08-24 14:37:08,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 14:37:08,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 14:37:08,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:37:08,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 14:37:08,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-08-24 14:37:08,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 557 [2023-08-24 14:37:08,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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) [2023-08-24 14:37:08,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:37:08,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 557 [2023-08-24 14:37:08,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:37:10,711 INFO L124 PetriNetUnfolderBase]: 19561/26052 cut-off events. [2023-08-24 14:37:10,711 INFO L125 PetriNetUnfolderBase]: For 32444/32528 co-relation queries the response was YES. [2023-08-24 14:37:10,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74796 conditions, 26052 events. 19561/26052 cut-off events. For 32444/32528 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 130923 event pairs, 5063 based on Foata normal form. 126/24096 useless extension candidates. Maximal degree in co-relation 74763. Up to 17823 conditions per place. [2023-08-24 14:37:10,817 INFO L140 encePairwiseOnDemand]: 551/557 looper letters, 74 selfloop transitions, 10 changer transitions 2/108 dead transitions. [2023-08-24 14:37:10,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 108 transitions, 631 flow [2023-08-24 14:37:10,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 14:37:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 14:37:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1516 transitions. [2023-08-24 14:37:10,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45362058647516457 [2023-08-24 14:37:10,821 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1516 transitions. [2023-08-24 14:37:10,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1516 transitions. [2023-08-24 14:37:10,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:37:10,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1516 transitions. [2023-08-24 14:37:10,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 252.66666666666666) internal successors, (1516), 6 states have internal predecessors, (1516), 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) [2023-08-24 14:37:10,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 557.0) internal successors, (3899), 7 states have internal predecessors, (3899), 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) [2023-08-24 14:37:10,830 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 557.0) internal successors, (3899), 7 states have internal predecessors, (3899), 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) [2023-08-24 14:37:10,830 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 383 flow. Second operand 6 states and 1516 transitions. [2023-08-24 14:37:10,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 108 transitions, 631 flow [2023-08-24 14:37:11,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 108 transitions, 583 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-08-24 14:37:11,020 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 361 flow [2023-08-24 14:37:11,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=361, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2023-08-24 14:37:11,021 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 11 predicate places. [2023-08-24 14:37:11,021 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 361 flow [2023-08-24 14:37:11,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 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) [2023-08-24 14:37:11,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:37:11,022 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:37:11,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 14:37:11,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:37:11,228 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:37:11,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:37:11,229 INFO L85 PathProgramCache]: Analyzing trace with hash 351726505, now seen corresponding path program 1 times [2023-08-24 14:37:11,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:37:11,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400352774] [2023-08-24 14:37:11,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:37:11,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:37:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:37:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 14:37:11,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:37:11,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400352774] [2023-08-24 14:37:11,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400352774] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 14:37:11,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 14:37:11,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 14:37:11,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533542425] [2023-08-24 14:37:11,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 14:37:11,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 14:37:11,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:37:11,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 14:37:11,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 14:37:11,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 557 [2023-08-24 14:37:11,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 361 flow. Second operand has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 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) [2023-08-24 14:37:11,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:37:11,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 557 [2023-08-24 14:37:11,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:37:13,885 INFO L124 PetriNetUnfolderBase]: 21990/29081 cut-off events. [2023-08-24 14:37:13,885 INFO L125 PetriNetUnfolderBase]: For 26760/26916 co-relation queries the response was YES. [2023-08-24 14:37:13,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82504 conditions, 29081 events. 21990/29081 cut-off events. For 26760/26916 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 141527 event pairs, 5027 based on Foata normal form. 108/26915 useless extension candidates. Maximal degree in co-relation 82469. Up to 19453 conditions per place. [2023-08-24 14:37:13,995 INFO L140 encePairwiseOnDemand]: 550/557 looper letters, 111 selfloop transitions, 17 changer transitions 13/163 dead transitions. [2023-08-24 14:37:13,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 163 transitions, 941 flow [2023-08-24 14:37:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 14:37:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 14:37:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1368 transitions. [2023-08-24 14:37:13,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4912028725314183 [2023-08-24 14:37:13,998 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1368 transitions. [2023-08-24 14:37:13,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1368 transitions. [2023-08-24 14:37:13,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:37:13,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1368 transitions. [2023-08-24 14:37:14,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 273.6) internal successors, (1368), 5 states have internal predecessors, (1368), 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) [2023-08-24 14:37:14,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 557.0) internal successors, (3342), 6 states have internal predecessors, (3342), 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) [2023-08-24 14:37:14,006 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 557.0) internal successors, (3342), 6 states have internal predecessors, (3342), 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) [2023-08-24 14:37:14,006 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 361 flow. Second operand 5 states and 1368 transitions. [2023-08-24 14:37:14,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 163 transitions, 941 flow [2023-08-24 14:37:14,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 163 transitions, 936 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 14:37:14,017 INFO L231 Difference]: Finished difference. Result has 85 places, 91 transitions, 494 flow [2023-08-24 14:37:14,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=557, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=85, PETRI_TRANSITIONS=91} [2023-08-24 14:37:14,017 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 14 predicate places. [2023-08-24 14:37:14,018 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 494 flow [2023-08-24 14:37:14,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 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) [2023-08-24 14:37:14,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:37:14,018 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:37:14,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 14:37:14,018 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:37:14,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:37:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash -88238672, now seen corresponding path program 1 times [2023-08-24 14:37:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:37:14,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549968707] [2023-08-24 14:37:14,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:37:14,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:37:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:37:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:37:15,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:37:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549968707] [2023-08-24 14:37:15,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549968707] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:37:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645496675] [2023-08-24 14:37:15,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:37:15,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:37:15,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:37:15,669 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) [2023-08-24 14:37:15,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 14:37:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:37:15,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 99 conjunts are in the unsatisfiable core [2023-08-24 14:37:15,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:37:15,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 14:37:16,117 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 14:37:16,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 14:37:16,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 14:37:16,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 14:37:16,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 14:37:16,969 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 14:37:17,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 14:37:17,102 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 14:37:17,295 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-08-24 14:37:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:37:17,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 14:37:38,594 WARN L234 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:38:17,786 WARN L234 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:38:42,559 WARN L234 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:39:18,871 WARN L234 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:39:23,313 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 14:39:23,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 58 [2023-08-24 14:39:23,346 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83681270 treesize of output 81764342 [2023-08-24 14:39:23,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1066 treesize of output 1042 [2023-08-24 14:39:23,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 526 treesize of output 514 [2023-08-24 14:39:23,976 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 966 [2023-08-24 14:39:24,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 966 treesize of output 838 [2023-08-24 14:39:24,033 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 838 treesize of output 742 [2023-08-24 14:39:24,056 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 742 treesize of output 694 [2023-08-24 14:39:25,217 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 14:39:25,234 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-24 14:39:25,234 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2023-08-24 14:39:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:39:29,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645496675] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 14:39:29,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 14:39:29,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 17] total 43 [2023-08-24 14:39:29,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283519765] [2023-08-24 14:39:29,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 14:39:29,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-24 14:39:29,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:39:29,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-24 14:39:29,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1690, Unknown=61, NotChecked=0, Total=1980 [2023-08-24 14:39:29,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 557 [2023-08-24 14:39:29,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 91 transitions, 494 flow. Second operand has 45 states, 45 states have (on average 189.73333333333332) internal successors, (8538), 45 states have internal predecessors, (8538), 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) [2023-08-24 14:39:29,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:39:29,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 557 [2023-08-24 14:39:29,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:39:47,497 WARN L234 SmtUtils]: Spent 16.36s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:39:50,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 14:39:52,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 14:40:11,195 WARN L234 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:40:30,100 WARN L234 SmtUtils]: Spent 16.07s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:40:32,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 14:40:35,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 14:40:37,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 14:40:39,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 14:42:48,950 WARN L234 SmtUtils]: Spent 2.06m on a formula simplification. DAG size of input: 289 DAG size of output: 286 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:43:43,657 WARN L234 SmtUtils]: Spent 52.40s on a formula simplification. DAG size of input: 252 DAG size of output: 242 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:45:00,821 WARN L234 SmtUtils]: Spent 1.25m on a formula simplification. DAG size of input: 253 DAG size of output: 242 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:45:04,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 14:45:45,775 WARN L234 SmtUtils]: Spent 32.06s on a formula simplification that was a NOOP. DAG size: 254 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:45:47,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 14:46:44,322 WARN L234 SmtUtils]: Spent 43.87s on a formula simplification that was a NOOP. DAG size: 270 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:47:27,116 WARN L234 SmtUtils]: Spent 34.80s on a formula simplification that was a NOOP. DAG size: 282 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:47:29,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 14:47:48,710 WARN L234 SmtUtils]: Spent 14.06s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:48:32,020 WARN L234 SmtUtils]: Spent 35.28s on a formula simplification. DAG size of input: 233 DAG size of output: 223 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:49:03,515 WARN L234 SmtUtils]: Spent 22.74s on a formula simplification that was a NOOP. DAG size: 245 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 14:49:09,605 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-08-24 14:49:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-24 14:49:09,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-08-24 14:49:09,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-24 14:49:09,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:49:09,809 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:935) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:774) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:362) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 55 more [2023-08-24 14:49:09,812 INFO L158 Benchmark]: Toolchain (without parser) took 745308.52ms. Allocated memory was 371.2MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 346.7MB in the beginning and 4.7GB in the end (delta: -4.4GB). Peak memory consumption was 975.9MB. Max. memory is 16.0GB. [2023-08-24 14:49:09,812 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 371.2MB. Free memory was 348.6MB in the beginning and 348.5MB in the end (delta: 94.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 14:49:09,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.66ms. Allocated memory is still 371.2MB. Free memory was 346.1MB in the beginning and 333.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 14:49:09,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.32ms. Allocated memory is still 371.2MB. Free memory was 333.4MB in the beginning and 330.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 14:49:09,813 INFO L158 Benchmark]: Boogie Preprocessor took 50.12ms. Allocated memory is still 371.2MB. Free memory was 330.3MB in the beginning and 328.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 14:49:09,814 INFO L158 Benchmark]: RCFGBuilder took 914.18ms. Allocated memory is still 371.2MB. Free memory was 327.8MB in the beginning and 265.9MB in the end (delta: 61.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.0GB. [2023-08-24 14:49:09,814 INFO L158 Benchmark]: TraceAbstraction took 744075.15ms. Allocated memory was 371.2MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 265.3MB in the beginning and 4.7GB in the end (delta: -4.5GB). Peak memory consumption was 894.1MB. Max. memory is 16.0GB. [2023-08-24 14:49:09,815 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 371.2MB. Free memory was 348.6MB in the beginning and 348.5MB in the end (delta: 94.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 214.66ms. Allocated memory is still 371.2MB. Free memory was 346.1MB in the beginning and 333.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 47.32ms. Allocated memory is still 371.2MB. Free memory was 333.4MB in the beginning and 330.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.12ms. Allocated memory is still 371.2MB. Free memory was 330.3MB in the beginning and 328.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 914.18ms. Allocated memory is still 371.2MB. Free memory was 327.8MB in the beginning and 265.9MB in the end (delta: 61.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.0GB. * TraceAbstraction took 744075.15ms. Allocated memory was 371.2MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 265.3MB in the beginning and 4.7GB in the end (delta: -4.5GB). Peak memory consumption was 894.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 257 PlacesBefore, 71 PlacesAfterwards, 259 TransitionsBefore, 61 TransitionsAfterwards, 8992 CoEnabledTransitionPairs, 9 FixpointIterations, 122 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 23 TrivialYvCompositions, 24 ConcurrentYvCompositions, 12 ChoiceCompositions, 242 TotalNumberOfCompositions, 32361 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20834, independent: 20371, independent conditional: 0, independent unconditional: 20371, dependent: 463, dependent conditional: 0, dependent unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4999, independent: 4936, independent conditional: 0, independent unconditional: 4936, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 20834, independent: 15435, independent conditional: 0, independent unconditional: 15435, dependent: 400, dependent conditional: 0, dependent unconditional: 400, unknown: 4999, unknown conditional: 0, unknown unconditional: 4999] , Statistics on independence cache: Total cache size (in pairs): 657, Positive cache size: 627, Positive conditional cache size: 0, Positive unconditional cache size: 627, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...