/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -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-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:14:49,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:14:49,874 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-SemanticLbe.epf [2023-11-17 11:14:49,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:14:49,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:14:49,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:14:49,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:14:49,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:14:49,908 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:14:49,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:14:49,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:14:49,909 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:14:49,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:14:49,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:14:49,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:14:49,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:14:49,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:14:49,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:14:49,911 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:14:49,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:14:49,912 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:14:49,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:14:49,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:14:49,916 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:14:49,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:14:49,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:14:49,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:14:49,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:14:49,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:14:49,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:14:49,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:14:49,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:14:49,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:14:50,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:14:50,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:14:50,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:14:50,184 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:14:50,185 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:14:50,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2023-11-17 11:14:51,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:14:51,628 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:14:51,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2023-11-17 11:14:51,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63e854e1/7a248efa2b674887b93edab719ef9abe/FLAGab728f1cc [2023-11-17 11:14:51,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63e854e1/7a248efa2b674887b93edab719ef9abe [2023-11-17 11:14:51,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:14:51,666 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:14:51,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:14:51,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:14:51,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:14:51,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:14:51" (1/1) ... [2023-11-17 11:14:51,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a985f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:51, skipping insertion in model container [2023-11-17 11:14:51,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:14:51" (1/1) ... [2023-11-17 11:14:51,738 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:14:52,118 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2023-11-17 11:14:52,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:14:52,170 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:14:52,211 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2023-11-17 11:14:52,220 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:14:52,290 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:14:52,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52 WrapperNode [2023-11-17 11:14:52,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:14:52,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:14:52,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:14:52,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:14:52,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (1/1) ... [2023-11-17 11:14:52,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (1/1) ... [2023-11-17 11:14:52,360 INFO L138 Inliner]: procedures = 278, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 158 [2023-11-17 11:14:52,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:14:52,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:14:52,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:14:52,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:14:52,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (1/1) ... [2023-11-17 11:14:52,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (1/1) ... [2023-11-17 11:14:52,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (1/1) ... [2023-11-17 11:14:52,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (1/1) ... [2023-11-17 11:14:52,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (1/1) ... [2023-11-17 11:14:52,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (1/1) ... [2023-11-17 11:14:52,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (1/1) ... [2023-11-17 11:14:52,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (1/1) ... [2023-11-17 11:14:52,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:14:52,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:14:52,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:14:52,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:14:52,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (1/1) ... [2023-11-17 11:14:52,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:14:52,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:14:52,443 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-11-17 11:14:52,453 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-11-17 11:14:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-17 11:14:52,476 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-17 11:14:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-17 11:14:52,476 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-17 11:14:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:14:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:14:52,476 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 11:14:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:14:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:14:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 11:14:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:14:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:14:52,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:14:52,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:14:52,479 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:14:52,605 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:14:52,606 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:14:52,842 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:14:53,162 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:14:53,163 INFO L307 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-17 11:14:53,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:14:53 BoogieIcfgContainer [2023-11-17 11:14:53,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:14:53,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:14:53,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:14:53,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:14:53,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:14:51" (1/3) ... [2023-11-17 11:14:53,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a78876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:14:53, skipping insertion in model container [2023-11-17 11:14:53,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:14:52" (2/3) ... [2023-11-17 11:14:53,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a78876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:14:53, skipping insertion in model container [2023-11-17 11:14:53,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:14:53" (3/3) ... [2023-11-17 11:14:53,176 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-1.i [2023-11-17 11:14:53,190 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:14:53,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:14:53,190 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:14:53,244 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 11:14:53,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 84 flow [2023-11-17 11:14:53,330 INFO L124 PetriNetUnfolderBase]: 5/33 cut-off events. [2023-11-17 11:14:53,331 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:14:53,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 5/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2023-11-17 11:14:53,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 35 transitions, 84 flow [2023-11-17 11:14:53,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 71 flow [2023-11-17 11:14:53,350 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:14:53,371 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 31 transitions, 71 flow [2023-11-17 11:14:53,375 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 31 transitions, 71 flow [2023-11-17 11:14:53,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 71 flow [2023-11-17 11:14:53,397 INFO L124 PetriNetUnfolderBase]: 5/31 cut-off events. [2023-11-17 11:14:53,397 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 11:14:53,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 31 events. 5/31 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2023-11-17 11:14:53,399 INFO L119 LiptonReduction]: Number of co-enabled transitions 430 [2023-11-17 11:14:54,352 INFO L134 LiptonReduction]: Checked pairs total: 1099 [2023-11-17 11:14:54,353 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-11-17 11:14:54,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:14:54,381 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2cf024a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:14:54,381 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:14:54,386 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:14:54,386 INFO L124 PetriNetUnfolderBase]: 3/12 cut-off events. [2023-11-17 11:14:54,386 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:14:54,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:14:54,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:14:54,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:14:54,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:14:54,394 INFO L85 PathProgramCache]: Analyzing trace with hash 400813171, now seen corresponding path program 1 times [2023-11-17 11:14:54,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:14:54,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379743559] [2023-11-17 11:14:54,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:14:54,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:14:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:14:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:14:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:14:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379743559] [2023-11-17 11:14:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379743559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:14:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:14:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:14:54,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714282316] [2023-11-17 11:14:54,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:14:54,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:14:54,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:14:54,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:14:54,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:14:54,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:14:54,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 51 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11-17 11:14:54,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:14:54,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:14:54,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:14:54,868 INFO L124 PetriNetUnfolderBase]: 191/332 cut-off events. [2023-11-17 11:14:54,868 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-17 11:14:54,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 332 events. 191/332 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1153 event pairs, 67 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 590. Up to 207 conditions per place. [2023-11-17 11:14:54,874 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 27 selfloop transitions, 2 changer transitions 3/32 dead transitions. [2023-11-17 11:14:54,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 32 transitions, 143 flow [2023-11-17 11:14:54,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:14:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:14:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2023-11-17 11:14:54,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35119047619047616 [2023-11-17 11:14:54,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 59 transitions. [2023-11-17 11:14:54,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 59 transitions. [2023-11-17 11:14:54,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:14:54,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 59 transitions. [2023-11-17 11:14:54,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-11-17 11:14:54,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-11-17 11:14:54,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-11-17 11:14:54,902 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 51 flow. Second operand 3 states and 59 transitions. [2023-11-17 11:14:54,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 32 transitions, 143 flow [2023-11-17 11:14:54,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 32 transitions, 135 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:14:54,909 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 56 flow [2023-11-17 11:14:54,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2023-11-17 11:14:54,914 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2023-11-17 11:14:54,914 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 56 flow [2023-11-17 11:14:54,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11-17 11:14:54,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:14:54,915 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:14:54,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:14:54,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:14:54,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:14:54,916 INFO L85 PathProgramCache]: Analyzing trace with hash 615332560, now seen corresponding path program 1 times [2023-11-17 11:14:54,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:14:54,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177224400] [2023-11-17 11:14:54,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:14:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:14:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:14:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:14:55,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:14:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177224400] [2023-11-17 11:14:55,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177224400] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:14:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062539150] [2023-11-17 11:14:55,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:14:55,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:14:55,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:14:55,120 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-11-17 11:14:55,148 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-11-17 11:14:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:14:55,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 11:14:55,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:14:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:14:55,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:14:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:14:55,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062539150] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:14:55,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:14:55,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2023-11-17 11:14:55,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665560116] [2023-11-17 11:14:55,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:14:55,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:14:55,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:14:55,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:14:55,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:14:55,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:14:55,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 56 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-11-17 11:14:55,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:14:55,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:14:55,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:14:55,786 INFO L124 PetriNetUnfolderBase]: 527/922 cut-off events. [2023-11-17 11:14:55,787 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-17 11:14:55,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 922 events. 527/922 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3720 event pairs, 69 based on Foata normal form. 10/778 useless extension candidates. Maximal degree in co-relation 1614. Up to 209 conditions per place. [2023-11-17 11:14:55,793 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 76 selfloop transitions, 11 changer transitions 3/90 dead transitions. [2023-11-17 11:14:55,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 90 transitions, 405 flow [2023-11-17 11:14:55,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:14:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:14:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2023-11-17 11:14:55,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3673469387755102 [2023-11-17 11:14:55,796 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 144 transitions. [2023-11-17 11:14:55,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 144 transitions. [2023-11-17 11:14:55,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:14:55,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 144 transitions. [2023-11-17 11:14:55,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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-11-17 11:14:55,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 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-11-17 11:14:55,802 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 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-11-17 11:14:55,802 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 56 flow. Second operand 7 states and 144 transitions. [2023-11-17 11:14:55,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 90 transitions, 405 flow [2023-11-17 11:14:55,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 90 transitions, 403 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:14:55,809 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 150 flow [2023-11-17 11:14:55,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2023-11-17 11:14:55,814 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2023-11-17 11:14:55,814 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 150 flow [2023-11-17 11:14:55,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-11-17 11:14:55,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:14:55,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:14:55,825 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-11-17 11:14:56,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:14:56,022 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:14:56,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:14:56,022 INFO L85 PathProgramCache]: Analyzing trace with hash -318679665, now seen corresponding path program 1 times [2023-11-17 11:14:56,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:14:56,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18659796] [2023-11-17 11:14:56,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:14:56,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:14:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:14:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:14:56,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:14:56,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18659796] [2023-11-17 11:14:56,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18659796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:14:56,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:14:56,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:14:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847300101] [2023-11-17 11:14:56,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:14:56,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:14:56,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:14:56,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:14:56,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:14:56,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 56 [2023-11-17 11:14:56,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-17 11:14:56,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:14:56,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 56 [2023-11-17 11:14:56,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:14:56,252 INFO L124 PetriNetUnfolderBase]: 352/649 cut-off events. [2023-11-17 11:14:56,252 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2023-11-17 11:14:56,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 649 events. 352/649 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2659 event pairs, 124 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 1327. Up to 374 conditions per place. [2023-11-17 11:14:56,257 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 33 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-11-17 11:14:56,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 237 flow [2023-11-17 11:14:56,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:14:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:14:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2023-11-17 11:14:56,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2023-11-17 11:14:56,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 54 transitions. [2023-11-17 11:14:56,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 54 transitions. [2023-11-17 11:14:56,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:14:56,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 54 transitions. [2023-11-17 11:14:56,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-11-17 11:14:56,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-11-17 11:14:56,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-11-17 11:14:56,261 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 150 flow. Second operand 3 states and 54 transitions. [2023-11-17 11:14:56,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 237 flow [2023-11-17 11:14:56,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 224 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-11-17 11:14:56,268 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 137 flow [2023-11-17 11:14:56,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-11-17 11:14:56,269 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2023-11-17 11:14:56,269 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 137 flow [2023-11-17 11:14:56,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-17 11:14:56,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:14:56,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:14:56,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:14:56,270 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:14:56,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:14:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1865017770, now seen corresponding path program 1 times [2023-11-17 11:14:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:14:56,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424906924] [2023-11-17 11:14:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:14:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:14:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:14:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:14:56,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:14:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424906924] [2023-11-17 11:14:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424906924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:14:56,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:14:56,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:14:56,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000670699] [2023-11-17 11:14:56,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:14:56,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:14:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:14:56,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:14:56,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:14:56,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:14:56,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-17 11:14:56,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:14:56,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:14:56,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:14:57,129 INFO L124 PetriNetUnfolderBase]: 432/797 cut-off events. [2023-11-17 11:14:57,129 INFO L125 PetriNetUnfolderBase]: For 479/479 co-relation queries the response was YES. [2023-11-17 11:14:57,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2172 conditions, 797 events. 432/797 cut-off events. For 479/479 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3345 event pairs, 141 based on Foata normal form. 6/797 useless extension candidates. Maximal degree in co-relation 1622. Up to 536 conditions per place. [2023-11-17 11:14:57,135 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 46 selfloop transitions, 5 changer transitions 5/56 dead transitions. [2023-11-17 11:14:57,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 345 flow [2023-11-17 11:14:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:14:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:14:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2023-11-17 11:14:57,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33482142857142855 [2023-11-17 11:14:57,138 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 75 transitions. [2023-11-17 11:14:57,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 75 transitions. [2023-11-17 11:14:57,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:14:57,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 75 transitions. [2023-11-17 11:14:57,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-11-17 11:14:57,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 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-11-17 11:14:57,140 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 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-11-17 11:14:57,141 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 137 flow. Second operand 4 states and 75 transitions. [2023-11-17 11:14:57,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 56 transitions, 345 flow [2023-11-17 11:14:57,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:14:57,146 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 169 flow [2023-11-17 11:14:57,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-11-17 11:14:57,147 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 14 predicate places. [2023-11-17 11:14:57,147 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 169 flow [2023-11-17 11:14:57,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-17 11:14:57,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:14:57,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:14:57,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:14:57,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:14:57,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:14:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash 402766182, now seen corresponding path program 2 times [2023-11-17 11:14:57,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:14:57,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182688769] [2023-11-17 11:14:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:14:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:14:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:14:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:14:57,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:14:57,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182688769] [2023-11-17 11:14:57,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182688769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:14:57,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:14:57,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:14:57,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623922880] [2023-11-17 11:14:57,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:14:57,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:14:57,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:14:57,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:14:57,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:14:57,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:14:57,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-17 11:14:57,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:14:57,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:14:57,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:14:57,745 INFO L124 PetriNetUnfolderBase]: 462/853 cut-off events. [2023-11-17 11:14:57,746 INFO L125 PetriNetUnfolderBase]: For 634/634 co-relation queries the response was YES. [2023-11-17 11:14:57,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 853 events. 462/853 cut-off events. For 634/634 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3610 event pairs, 144 based on Foata normal form. 6/853 useless extension candidates. Maximal degree in co-relation 1563. Up to 575 conditions per place. [2023-11-17 11:14:57,751 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 44 selfloop transitions, 5 changer transitions 6/55 dead transitions. [2023-11-17 11:14:57,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 355 flow [2023-11-17 11:14:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:14:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:14:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2023-11-17 11:14:57,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2023-11-17 11:14:57,753 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 74 transitions. [2023-11-17 11:14:57,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 74 transitions. [2023-11-17 11:14:57,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:14:57,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 74 transitions. [2023-11-17 11:14:57,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-11-17 11:14:57,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 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-11-17 11:14:57,755 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 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-11-17 11:14:57,755 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 169 flow. Second operand 4 states and 74 transitions. [2023-11-17 11:14:57,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 355 flow [2023-11-17 11:14:57,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:14:57,759 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 197 flow [2023-11-17 11:14:57,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-17 11:14:57,760 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 16 predicate places. [2023-11-17 11:14:57,760 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 197 flow [2023-11-17 11:14:57,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-17 11:14:57,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:14:57,760 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:14:57,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:14:57,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:14:57,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:14:57,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2122065449, now seen corresponding path program 3 times [2023-11-17 11:14:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:14:57,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800057439] [2023-11-17 11:14:57,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:14:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:14:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:14:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:14:58,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:14:58,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800057439] [2023-11-17 11:14:58,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800057439] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:14:58,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848698607] [2023-11-17 11:14:58,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 11:14:58,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:14:58,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:14:58,183 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-11-17 11:14:58,202 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-11-17 11:14:58,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-17 11:14:58,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:14:58,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-17 11:14:58,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:14:58,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-11-17 11:14:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:14:58,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 11:14:58,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848698607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:14:58,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 11:14:58,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2023-11-17 11:14:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766600347] [2023-11-17 11:14:58,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:14:58,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:14:58,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:14:58,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:14:58,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:14:58,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:14:58,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:14:58,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:14:58,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:14:58,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:14:58,706 INFO L124 PetriNetUnfolderBase]: 632/1165 cut-off events. [2023-11-17 11:14:58,706 INFO L125 PetriNetUnfolderBase]: For 1009/1009 co-relation queries the response was YES. [2023-11-17 11:14:58,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3154 conditions, 1165 events. 632/1165 cut-off events. For 1009/1009 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5500 event pairs, 291 based on Foata normal form. 18/1177 useless extension candidates. Maximal degree in co-relation 2364. Up to 667 conditions per place. [2023-11-17 11:14:58,715 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 39 selfloop transitions, 22 changer transitions 0/61 dead transitions. [2023-11-17 11:14:58,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 425 flow [2023-11-17 11:14:58,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:14:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:14:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2023-11-17 11:14:58,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2023-11-17 11:14:58,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 80 transitions. [2023-11-17 11:14:58,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 80 transitions. [2023-11-17 11:14:58,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:14:58,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 80 transitions. [2023-11-17 11:14:58,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-11-17 11:14:58,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 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-11-17 11:14:58,718 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 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-11-17 11:14:58,718 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 197 flow. Second operand 5 states and 80 transitions. [2023-11-17 11:14:58,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 425 flow [2023-11-17 11:14:58,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 412 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-17 11:14:58,724 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 306 flow [2023-11-17 11:14:58,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2023-11-17 11:14:58,725 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 18 predicate places. [2023-11-17 11:14:58,725 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 306 flow [2023-11-17 11:14:58,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:14:58,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:14:58,725 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:14:58,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 11:14:58,937 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,SelfDestructingSolverStorable5 [2023-11-17 11:14:58,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:14:58,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:14:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1490481133, now seen corresponding path program 4 times [2023-11-17 11:14:58,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:14:58,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838815197] [2023-11-17 11:14:58,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:14:58,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:14:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:14:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:14:59,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:14:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838815197] [2023-11-17 11:14:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838815197] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:14:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998588758] [2023-11-17 11:14:59,543 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 11:14:59,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:14:59,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:14:59,545 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-11-17 11:14:59,575 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-11-17 11:14:59,680 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 11:14:59,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:14:59,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-17 11:14:59,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:14:59,705 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 11:14:59,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-17 11:14:59,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 11:14:59,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:14:59,847 INFO L378 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 23 treesize of output 16 [2023-11-17 11:14:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:14:59,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:00,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:00,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2023-11-17 11:15:00,190 INFO L378 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 36 treesize of output 29 [2023-11-17 11:15:00,194 INFO L378 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 50 treesize of output 29 [2023-11-17 11:15:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:00,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998588758] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:00,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:00,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2023-11-17 11:15:00,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343954700] [2023-11-17 11:15:00,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:00,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 11:15:00,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:00,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 11:15:00,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=200, Unknown=1, NotChecked=0, Total=272 [2023-11-17 11:15:00,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:00,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 306 flow. Second operand has 17 states, 17 states have (on average 9.470588235294118) internal successors, (161), 17 states have internal predecessors, (161), 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-11-17 11:15:00,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:00,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:00,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:01,316 INFO L124 PetriNetUnfolderBase]: 1064/1948 cut-off events. [2023-11-17 11:15:01,316 INFO L125 PetriNetUnfolderBase]: For 2628/2628 co-relation queries the response was YES. [2023-11-17 11:15:01,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5765 conditions, 1948 events. 1064/1948 cut-off events. For 2628/2628 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9890 event pairs, 308 based on Foata normal form. 18/1960 useless extension candidates. Maximal degree in co-relation 4609. Up to 310 conditions per place. [2023-11-17 11:15:01,330 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 119 selfloop transitions, 56 changer transitions 6/181 dead transitions. [2023-11-17 11:15:01,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 181 transitions, 1264 flow [2023-11-17 11:15:01,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 11:15:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-17 11:15:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 266 transitions. [2023-11-17 11:15:01,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.296875 [2023-11-17 11:15:01,333 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 266 transitions. [2023-11-17 11:15:01,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 266 transitions. [2023-11-17 11:15:01,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:01,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 266 transitions. [2023-11-17 11:15:01,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 16.625) internal successors, (266), 16 states have internal predecessors, (266), 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-11-17 11:15:01,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 56.0) internal successors, (952), 17 states have internal predecessors, (952), 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-11-17 11:15:01,337 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 56.0) internal successors, (952), 17 states have internal predecessors, (952), 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-11-17 11:15:01,337 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 306 flow. Second operand 16 states and 266 transitions. [2023-11-17 11:15:01,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 181 transitions, 1264 flow [2023-11-17 11:15:01,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 181 transitions, 1260 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-17 11:15:01,348 INFO L231 Difference]: Finished difference. Result has 60 places, 83 transitions, 805 flow [2023-11-17 11:15:01,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=805, PETRI_PLACES=60, PETRI_TRANSITIONS=83} [2023-11-17 11:15:01,350 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 36 predicate places. [2023-11-17 11:15:01,350 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 83 transitions, 805 flow [2023-11-17 11:15:01,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.470588235294118) internal successors, (161), 17 states have internal predecessors, (161), 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-11-17 11:15:01,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:01,351 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:01,361 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-11-17 11:15:01,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:01,559 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:01,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash -740978336, now seen corresponding path program 1 times [2023-11-17 11:15:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:01,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486064812] [2023-11-17 11:15:01,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:02,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:02,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486064812] [2023-11-17 11:15:02,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486064812] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:02,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015255944] [2023-11-17 11:15:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:02,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:02,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:02,138 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-11-17 11:15:02,158 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-11-17 11:15:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:02,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-17 11:15:02,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:02,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:02,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2023-11-17 11:15:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:02,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:02,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015255944] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:02,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:02,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2023-11-17 11:15:02,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109175447] [2023-11-17 11:15:02,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:02,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 11:15:02,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:02,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 11:15:02,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-11-17 11:15:02,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:02,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 83 transitions, 805 flow. Second operand has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 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-11-17 11:15:02,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:02,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:02,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:03,783 INFO L124 PetriNetUnfolderBase]: 2069/3815 cut-off events. [2023-11-17 11:15:03,784 INFO L125 PetriNetUnfolderBase]: For 8535/8535 co-relation queries the response was YES. [2023-11-17 11:15:03,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12193 conditions, 3815 events. 2069/3815 cut-off events. For 8535/8535 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 22119 event pairs, 621 based on Foata normal form. 64/3873 useless extension candidates. Maximal degree in co-relation 8759. Up to 881 conditions per place. [2023-11-17 11:15:03,808 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 149 selfloop transitions, 91 changer transitions 17/257 dead transitions. [2023-11-17 11:15:03,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 257 transitions, 2389 flow [2023-11-17 11:15:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 11:15:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-17 11:15:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 270 transitions. [2023-11-17 11:15:03,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2023-11-17 11:15:03,810 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 270 transitions. [2023-11-17 11:15:03,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 270 transitions. [2023-11-17 11:15:03,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:03,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 270 transitions. [2023-11-17 11:15:03,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 18.0) internal successors, (270), 15 states have internal predecessors, (270), 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-11-17 11:15:03,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 56.0) internal successors, (896), 16 states have internal predecessors, (896), 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-11-17 11:15:03,814 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 56.0) internal successors, (896), 16 states have internal predecessors, (896), 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-11-17 11:15:03,814 INFO L175 Difference]: Start difference. First operand has 60 places, 83 transitions, 805 flow. Second operand 15 states and 270 transitions. [2023-11-17 11:15:03,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 257 transitions, 2389 flow [2023-11-17 11:15:03,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 257 transitions, 2053 flow, removed 147 selfloop flow, removed 3 redundant places. [2023-11-17 11:15:03,844 INFO L231 Difference]: Finished difference. Result has 80 places, 143 transitions, 1575 flow [2023-11-17 11:15:03,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1575, PETRI_PLACES=80, PETRI_TRANSITIONS=143} [2023-11-17 11:15:03,847 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 56 predicate places. [2023-11-17 11:15:03,847 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 143 transitions, 1575 flow [2023-11-17 11:15:03,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 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-11-17 11:15:03,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:03,848 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:03,857 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-11-17 11:15:04,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:04,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:04,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1767227762, now seen corresponding path program 2 times [2023-11-17 11:15:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:04,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760885434] [2023-11-17 11:15:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:04,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:04,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:04,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760885434] [2023-11-17 11:15:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760885434] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:04,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071648341] [2023-11-17 11:15:04,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 11:15:04,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:04,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:04,670 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-11-17 11:15:04,693 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-11-17 11:15:04,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 11:15:04,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:04,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-17 11:15:04,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:04,875 INFO L349 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2023-11-17 11:15:04,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 56 [2023-11-17 11:15:04,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:05,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-17 11:15:05,105 INFO L378 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 30 treesize of output 14 [2023-11-17 11:15:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:05,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:05,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:05,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-17 11:15:05,619 INFO L378 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 59 treesize of output 35 [2023-11-17 11:15:05,623 INFO L378 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 28 treesize of output 22 [2023-11-17 11:15:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071648341] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:05,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2023-11-17 11:15:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135932167] [2023-11-17 11:15:05,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:05,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 11:15:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:05,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 11:15:05,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-11-17 11:15:05,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:05,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 143 transitions, 1575 flow. Second operand has 21 states, 21 states have (on average 9.428571428571429) internal successors, (198), 21 states have internal predecessors, (198), 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-11-17 11:15:05,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:05,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:05,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:08,379 INFO L124 PetriNetUnfolderBase]: 3998/7342 cut-off events. [2023-11-17 11:15:08,379 INFO L125 PetriNetUnfolderBase]: For 15584/15584 co-relation queries the response was YES. [2023-11-17 11:15:08,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23988 conditions, 7342 events. 3998/7342 cut-off events. For 15584/15584 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 46665 event pairs, 712 based on Foata normal form. 48/7360 useless extension candidates. Maximal degree in co-relation 16180. Up to 1222 conditions per place. [2023-11-17 11:15:08,441 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 250 selfloop transitions, 207 changer transitions 24/481 dead transitions. [2023-11-17 11:15:08,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 481 transitions, 4777 flow [2023-11-17 11:15:08,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 11:15:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-17 11:15:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 491 transitions. [2023-11-17 11:15:08,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3023399014778325 [2023-11-17 11:15:08,448 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 491 transitions. [2023-11-17 11:15:08,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 491 transitions. [2023-11-17 11:15:08,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:08,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 491 transitions. [2023-11-17 11:15:08,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 16.93103448275862) internal successors, (491), 29 states have internal predecessors, (491), 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-11-17 11:15:08,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 56.0) internal successors, (1680), 30 states have internal predecessors, (1680), 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-11-17 11:15:08,453 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 56.0) internal successors, (1680), 30 states have internal predecessors, (1680), 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-11-17 11:15:08,454 INFO L175 Difference]: Start difference. First operand has 80 places, 143 transitions, 1575 flow. Second operand 29 states and 491 transitions. [2023-11-17 11:15:08,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 481 transitions, 4777 flow [2023-11-17 11:15:08,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 481 transitions, 4654 flow, removed 41 selfloop flow, removed 1 redundant places. [2023-11-17 11:15:08,535 INFO L231 Difference]: Finished difference. Result has 121 places, 269 transitions, 3771 flow [2023-11-17 11:15:08,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3771, PETRI_PLACES=121, PETRI_TRANSITIONS=269} [2023-11-17 11:15:08,537 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 97 predicate places. [2023-11-17 11:15:08,537 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 269 transitions, 3771 flow [2023-11-17 11:15:08,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.428571428571429) internal successors, (198), 21 states have internal predecessors, (198), 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-11-17 11:15:08,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:08,537 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:08,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 11:15:08,738 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-11-17 11:15:08,739 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:08,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1815648326, now seen corresponding path program 5 times [2023-11-17 11:15:08,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:08,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823364783] [2023-11-17 11:15:08,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:09,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:09,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823364783] [2023-11-17 11:15:09,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823364783] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:09,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003590904] [2023-11-17 11:15:09,312 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 11:15:09,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:09,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:09,314 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:09,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 11:15:09,448 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-17 11:15:09,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:09,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-17 11:15:09,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:09,477 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:15:09,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:15:09,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 11:15:09,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 11:15:09,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:09,747 INFO L378 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 23 treesize of output 16 [2023-11-17 11:15:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:09,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:10,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:10,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2023-11-17 11:15:10,184 INFO L378 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 57 treesize of output 36 [2023-11-17 11:15:10,188 INFO L378 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 29 treesize of output 22 [2023-11-17 11:15:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:10,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003590904] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:10,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:10,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2023-11-17 11:15:10,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073834129] [2023-11-17 11:15:10,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:10,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 11:15:10,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:10,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 11:15:10,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=398, Unknown=10, NotChecked=0, Total=552 [2023-11-17 11:15:10,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:10,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 269 transitions, 3771 flow. Second operand has 24 states, 24 states have (on average 9.125) internal successors, (219), 24 states have internal predecessors, (219), 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-11-17 11:15:10,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:10,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:10,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:11,533 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (and (or (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (forall ((v_ArrVal_386 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_386) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))))) (or (< (+ c_~top~0 2147483648) 0) (= 5 c_~top~0) (< 2147483647 c_~top~0) (forall ((v_z_17 Int) (v_ArrVal_386 (Array Int Int))) (or (< v_z_17 0) (not (= 4294967294 (mod (let ((.cse1 (+ |c_~#arr~0.offset| .cse0))) (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) .cse1 v_z_17)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_386) |c_~#arr~0.base|) .cse1)) 4294967296))) (< 4 v_z_17)))))) is different from false [2023-11-17 11:15:12,929 INFO L124 PetriNetUnfolderBase]: 5622/10374 cut-off events. [2023-11-17 11:15:12,929 INFO L125 PetriNetUnfolderBase]: For 38828/38828 co-relation queries the response was YES. [2023-11-17 11:15:12,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37232 conditions, 10374 events. 5622/10374 cut-off events. For 38828/38828 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 70820 event pairs, 1433 based on Foata normal form. 24/10386 useless extension candidates. Maximal degree in co-relation 35725. Up to 2994 conditions per place. [2023-11-17 11:15:13,012 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 266 selfloop transitions, 247 changer transitions 9/522 dead transitions. [2023-11-17 11:15:13,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 522 transitions, 7208 flow [2023-11-17 11:15:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 11:15:13,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-17 11:15:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 311 transitions. [2023-11-17 11:15:13,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29229323308270677 [2023-11-17 11:15:13,015 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 311 transitions. [2023-11-17 11:15:13,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 311 transitions. [2023-11-17 11:15:13,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:13,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 311 transitions. [2023-11-17 11:15:13,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 16.36842105263158) internal successors, (311), 19 states have internal predecessors, (311), 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-11-17 11:15:13,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 56.0) internal successors, (1120), 20 states have internal predecessors, (1120), 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-11-17 11:15:13,021 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 56.0) internal successors, (1120), 20 states have internal predecessors, (1120), 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-11-17 11:15:13,021 INFO L175 Difference]: Start difference. First operand has 121 places, 269 transitions, 3771 flow. Second operand 19 states and 311 transitions. [2023-11-17 11:15:13,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 522 transitions, 7208 flow [2023-11-17 11:15:13,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 522 transitions, 6986 flow, removed 105 selfloop flow, removed 3 redundant places. [2023-11-17 11:15:13,324 INFO L231 Difference]: Finished difference. Result has 143 places, 386 transitions, 6235 flow [2023-11-17 11:15:13,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3600, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6235, PETRI_PLACES=143, PETRI_TRANSITIONS=386} [2023-11-17 11:15:13,326 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 119 predicate places. [2023-11-17 11:15:13,326 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 386 transitions, 6235 flow [2023-11-17 11:15:13,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.125) internal successors, (219), 24 states have internal predecessors, (219), 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-11-17 11:15:13,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:13,326 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2023-11-17 11:15:13,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 11:15:13,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:13,534 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:13,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:13,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1863995955, now seen corresponding path program 2 times [2023-11-17 11:15:13,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:13,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288842137] [2023-11-17 11:15:13,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:13,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288842137] [2023-11-17 11:15:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288842137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512305599] [2023-11-17 11:15:13,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 11:15:13,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:13,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:13,696 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:13,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 11:15:13,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 11:15:13,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:13,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-17 11:15:13,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:13,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 11:15:13,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 11:15:13,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 11:15:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:14,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:14,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512305599] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:14,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:14,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2023-11-17 11:15:14,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804702131] [2023-11-17 11:15:14,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:14,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 11:15:14,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:14,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 11:15:14,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2023-11-17 11:15:14,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:14,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 386 transitions, 6235 flow. Second operand has 24 states, 24 states have (on average 9.041666666666666) internal successors, (217), 24 states have internal predecessors, (217), 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-11-17 11:15:14,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:14,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:14,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:17,401 INFO L124 PetriNetUnfolderBase]: 6927/12915 cut-off events. [2023-11-17 11:15:17,401 INFO L125 PetriNetUnfolderBase]: For 75053/75053 co-relation queries the response was YES. [2023-11-17 11:15:17,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52910 conditions, 12915 events. 6927/12915 cut-off events. For 75053/75053 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 92738 event pairs, 1270 based on Foata normal form. 311/13208 useless extension candidates. Maximal degree in co-relation 51243. Up to 4384 conditions per place. [2023-11-17 11:15:17,517 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 199 selfloop transitions, 378 changer transitions 6/583 dead transitions. [2023-11-17 11:15:17,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 583 transitions, 9293 flow [2023-11-17 11:15:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 11:15:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-17 11:15:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 273 transitions. [2023-11-17 11:15:17,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3046875 [2023-11-17 11:15:17,521 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 273 transitions. [2023-11-17 11:15:17,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 273 transitions. [2023-11-17 11:15:17,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:17,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 273 transitions. [2023-11-17 11:15:17,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 17.0625) internal successors, (273), 16 states have internal predecessors, (273), 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-11-17 11:15:17,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 56.0) internal successors, (952), 17 states have internal predecessors, (952), 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-11-17 11:15:17,525 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 56.0) internal successors, (952), 17 states have internal predecessors, (952), 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-11-17 11:15:17,525 INFO L175 Difference]: Start difference. First operand has 143 places, 386 transitions, 6235 flow. Second operand 16 states and 273 transitions. [2023-11-17 11:15:17,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 583 transitions, 9293 flow [2023-11-17 11:15:17,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 583 transitions, 9103 flow, removed 66 selfloop flow, removed 4 redundant places. [2023-11-17 11:15:17,993 INFO L231 Difference]: Finished difference. Result has 160 places, 477 transitions, 8767 flow [2023-11-17 11:15:17,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=5867, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=8767, PETRI_PLACES=160, PETRI_TRANSITIONS=477} [2023-11-17 11:15:17,994 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 136 predicate places. [2023-11-17 11:15:17,994 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 477 transitions, 8767 flow [2023-11-17 11:15:17,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.041666666666666) internal successors, (217), 24 states have internal predecessors, (217), 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-11-17 11:15:17,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:17,994 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:18,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-17 11:15:18,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:18,195 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:18,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:18,196 INFO L85 PathProgramCache]: Analyzing trace with hash -838651303, now seen corresponding path program 3 times [2023-11-17 11:15:18,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:18,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149668921] [2023-11-17 11:15:18,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:18,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:18,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149668921] [2023-11-17 11:15:18,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149668921] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439091373] [2023-11-17 11:15:18,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 11:15:18,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:18,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:18,836 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:18,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 11:15:19,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 11:15:19,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:19,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-17 11:15:19,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:19,040 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:15:19,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:15:19,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-17 11:15:19,343 INFO L378 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 48 treesize of output 19 [2023-11-17 11:15:19,489 INFO L378 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 33 treesize of output 26 [2023-11-17 11:15:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:15:19,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:20,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:20,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 60 [2023-11-17 11:15:20,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:20,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 61 [2023-11-17 11:15:20,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:20,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 32 [2023-11-17 11:15:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:15:20,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439091373] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:20,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:20,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2023-11-17 11:15:20,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260405447] [2023-11-17 11:15:20,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:20,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 11:15:20,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:20,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 11:15:20,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=374, Unknown=1, NotChecked=0, Total=462 [2023-11-17 11:15:20,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:20,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 477 transitions, 8767 flow. Second operand has 22 states, 22 states have (on average 9.636363636363637) internal successors, (212), 22 states have internal predecessors, (212), 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-11-17 11:15:20,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:20,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:20,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:24,608 INFO L124 PetriNetUnfolderBase]: 7771/14522 cut-off events. [2023-11-17 11:15:24,609 INFO L125 PetriNetUnfolderBase]: For 98084/98084 co-relation queries the response was YES. [2023-11-17 11:15:24,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62873 conditions, 14522 events. 7771/14522 cut-off events. For 98084/98084 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 105798 event pairs, 1657 based on Foata normal form. 22/14544 useless extension candidates. Maximal degree in co-relation 60728. Up to 4945 conditions per place. [2023-11-17 11:15:24,723 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 193 selfloop transitions, 492 changer transitions 9/694 dead transitions. [2023-11-17 11:15:24,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 694 transitions, 12059 flow [2023-11-17 11:15:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-17 11:15:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-17 11:15:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 395 transitions. [2023-11-17 11:15:24,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2612433862433862 [2023-11-17 11:15:24,725 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 395 transitions. [2023-11-17 11:15:24,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 395 transitions. [2023-11-17 11:15:24,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:24,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 395 transitions. [2023-11-17 11:15:24,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 14.62962962962963) internal successors, (395), 27 states have internal predecessors, (395), 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-11-17 11:15:24,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 56.0) internal successors, (1568), 28 states have internal predecessors, (1568), 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-11-17 11:15:24,732 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 56.0) internal successors, (1568), 28 states have internal predecessors, (1568), 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-11-17 11:15:24,733 INFO L175 Difference]: Start difference. First operand has 160 places, 477 transitions, 8767 flow. Second operand 27 states and 395 transitions. [2023-11-17 11:15:24,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 694 transitions, 12059 flow [2023-11-17 11:15:25,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 694 transitions, 11552 flow, removed 168 selfloop flow, removed 5 redundant places. [2023-11-17 11:15:25,430 INFO L231 Difference]: Finished difference. Result has 183 places, 551 transitions, 10759 flow [2023-11-17 11:15:25,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=8317, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=415, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=10759, PETRI_PLACES=183, PETRI_TRANSITIONS=551} [2023-11-17 11:15:25,431 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 159 predicate places. [2023-11-17 11:15:25,431 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 551 transitions, 10759 flow [2023-11-17 11:15:25,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.636363636363637) internal successors, (212), 22 states have internal predecessors, (212), 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-11-17 11:15:25,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:25,432 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2023-11-17 11:15:25,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-17 11:15:25,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-17 11:15:25,632 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:25,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash 670563600, now seen corresponding path program 3 times [2023-11-17 11:15:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:25,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846279565] [2023-11-17 11:15:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846279565] [2023-11-17 11:15:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846279565] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345503920] [2023-11-17 11:15:25,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 11:15:25,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:25,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:25,747 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:25,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 11:15:26,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-17 11:15:26,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:26,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 11:15:26,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:26,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 11:15:26,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345503920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:26,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 11:15:26,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2023-11-17 11:15:26,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468585558] [2023-11-17 11:15:26,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:26,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:15:26,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:26,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:15:26,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-11-17 11:15:26,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:26,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 551 transitions, 10759 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:26,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:26,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:26,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:28,499 INFO L124 PetriNetUnfolderBase]: 6735/12406 cut-off events. [2023-11-17 11:15:28,499 INFO L125 PetriNetUnfolderBase]: For 80491/80491 co-relation queries the response was YES. [2023-11-17 11:15:28,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51771 conditions, 12406 events. 6735/12406 cut-off events. For 80491/80491 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 89237 event pairs, 1807 based on Foata normal form. 586/12984 useless extension candidates. Maximal degree in co-relation 50355. Up to 7997 conditions per place. [2023-11-17 11:15:28,619 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 255 selfloop transitions, 71 changer transitions 234/560 dead transitions. [2023-11-17 11:15:28,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 560 transitions, 11080 flow [2023-11-17 11:15:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:15:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:15:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2023-11-17 11:15:28,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3169642857142857 [2023-11-17 11:15:28,621 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 142 transitions. [2023-11-17 11:15:28,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 142 transitions. [2023-11-17 11:15:28,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:28,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 142 transitions. [2023-11-17 11:15:28,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:28,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 56.0) internal successors, (504), 9 states have internal predecessors, (504), 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-11-17 11:15:28,622 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 56.0) internal successors, (504), 9 states have internal predecessors, (504), 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-11-17 11:15:28,622 INFO L175 Difference]: Start difference. First operand has 183 places, 551 transitions, 10759 flow. Second operand 8 states and 142 transitions. [2023-11-17 11:15:28,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 560 transitions, 11080 flow [2023-11-17 11:15:29,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 560 transitions, 10229 flow, removed 68 selfloop flow, removed 13 redundant places. [2023-11-17 11:15:29,259 INFO L231 Difference]: Finished difference. Result has 167 places, 239 transitions, 4127 flow [2023-11-17 11:15:29,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=5589, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4127, PETRI_PLACES=167, PETRI_TRANSITIONS=239} [2023-11-17 11:15:29,260 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 143 predicate places. [2023-11-17 11:15:29,260 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 239 transitions, 4127 flow [2023-11-17 11:15:29,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:29,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:29,260 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:29,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-17 11:15:29,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-17 11:15:29,461 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:29,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:29,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2143923824, now seen corresponding path program 4 times [2023-11-17 11:15:29,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:29,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005285598] [2023-11-17 11:15:29,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:29,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:30,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005285598] [2023-11-17 11:15:30,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005285598] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750587425] [2023-11-17 11:15:30,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 11:15:30,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:30,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:30,321 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:30,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-17 11:15:30,490 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 11:15:30,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:30,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-17 11:15:30,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:30,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:30,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2023-11-17 11:15:30,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2023-11-17 11:15:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:30,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:31,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750587425] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:31,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:31,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 21 [2023-11-17 11:15:31,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484685939] [2023-11-17 11:15:31,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:31,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 11:15:31,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 11:15:31,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2023-11-17 11:15:31,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:31,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 239 transitions, 4127 flow. Second operand has 22 states, 22 states have (on average 10.136363636363637) internal successors, (223), 22 states have internal predecessors, (223), 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-11-17 11:15:31,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:31,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:31,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:33,941 INFO L124 PetriNetUnfolderBase]: 3544/7188 cut-off events. [2023-11-17 11:15:33,942 INFO L125 PetriNetUnfolderBase]: For 51610/51610 co-relation queries the response was YES. [2023-11-17 11:15:33,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31380 conditions, 7188 events. 3544/7188 cut-off events. For 51610/51610 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 53793 event pairs, 699 based on Foata normal form. 58/7232 useless extension candidates. Maximal degree in co-relation 30066. Up to 1461 conditions per place. [2023-11-17 11:15:33,992 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 232 selfloop transitions, 154 changer transitions 178/564 dead transitions. [2023-11-17 11:15:33,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 564 transitions, 8521 flow [2023-11-17 11:15:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-17 11:15:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-17 11:15:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 436 transitions. [2023-11-17 11:15:33,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2780612244897959 [2023-11-17 11:15:33,994 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 436 transitions. [2023-11-17 11:15:33,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 436 transitions. [2023-11-17 11:15:33,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:33,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 436 transitions. [2023-11-17 11:15:33,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 15.571428571428571) internal successors, (436), 28 states have internal predecessors, (436), 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-11-17 11:15:33,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 56.0) internal successors, (1624), 29 states have internal predecessors, (1624), 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-11-17 11:15:33,998 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 56.0) internal successors, (1624), 29 states have internal predecessors, (1624), 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-11-17 11:15:33,998 INFO L175 Difference]: Start difference. First operand has 167 places, 239 transitions, 4127 flow. Second operand 28 states and 436 transitions. [2023-11-17 11:15:33,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 564 transitions, 8521 flow [2023-11-17 11:15:34,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 564 transitions, 8231 flow, removed 31 selfloop flow, removed 11 redundant places. [2023-11-17 11:15:34,236 INFO L231 Difference]: Finished difference. Result has 194 places, 239 transitions, 4592 flow [2023-11-17 11:15:34,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3949, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4592, PETRI_PLACES=194, PETRI_TRANSITIONS=239} [2023-11-17 11:15:34,237 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 170 predicate places. [2023-11-17 11:15:34,237 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 239 transitions, 4592 flow [2023-11-17 11:15:34,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.136363636363637) internal successors, (223), 22 states have internal predecessors, (223), 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-11-17 11:15:34,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:34,237 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:34,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-17 11:15:34,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-17 11:15:34,444 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:34,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1841954316, now seen corresponding path program 5 times [2023-11-17 11:15:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:34,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789158239] [2023-11-17 11:15:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:34,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:35,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:35,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789158239] [2023-11-17 11:15:35,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789158239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:35,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217253234] [2023-11-17 11:15:35,343 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 11:15:35,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:35,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:35,345 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:35,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-17 11:15:35,530 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-17 11:15:35,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:35,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-17 11:15:35,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:35,549 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 11:15:35,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-17 11:15:35,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:35,679 INFO L378 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 23 treesize of output 16 [2023-11-17 11:15:35,736 INFO L378 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 30 treesize of output 14 [2023-11-17 11:15:35,812 INFO L378 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 30 treesize of output 14 [2023-11-17 11:15:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:36,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:36,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:36,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-17 11:15:36,787 INFO L378 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 59 treesize of output 35 [2023-11-17 11:15:36,791 INFO L378 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 28 treesize of output 22 [2023-11-17 11:15:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:36,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217253234] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:36,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:36,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2023-11-17 11:15:36,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935901515] [2023-11-17 11:15:36,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:36,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-17 11:15:36,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:36,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-17 11:15:36,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2023-11-17 11:15:36,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:36,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 239 transitions, 4592 flow. Second operand has 29 states, 29 states have (on average 9.379310344827585) internal successors, (272), 29 states have internal predecessors, (272), 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-11-17 11:15:36,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:36,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:36,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:40,147 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-11-17 11:15:42,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:15:44,826 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-11-17 11:15:46,068 INFO L124 PetriNetUnfolderBase]: 2762/5557 cut-off events. [2023-11-17 11:15:46,069 INFO L125 PetriNetUnfolderBase]: For 50893/50893 co-relation queries the response was YES. [2023-11-17 11:15:46,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25527 conditions, 5557 events. 2762/5557 cut-off events. For 50893/50893 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 38680 event pairs, 468 based on Foata normal form. 58/5609 useless extension candidates. Maximal degree in co-relation 25206. Up to 1077 conditions per place. [2023-11-17 11:15:46,106 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 217 selfloop transitions, 183 changer transitions 69/469 dead transitions. [2023-11-17 11:15:46,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 469 transitions, 7122 flow [2023-11-17 11:15:46,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-17 11:15:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-17 11:15:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 464 transitions. [2023-11-17 11:15:46,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2672811059907834 [2023-11-17 11:15:46,107 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 464 transitions. [2023-11-17 11:15:46,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 464 transitions. [2023-11-17 11:15:46,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:46,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 464 transitions. [2023-11-17 11:15:46,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 14.96774193548387) internal successors, (464), 31 states have internal predecessors, (464), 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-11-17 11:15:46,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 56.0) internal successors, (1792), 32 states have internal predecessors, (1792), 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-11-17 11:15:46,112 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 56.0) internal successors, (1792), 32 states have internal predecessors, (1792), 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-11-17 11:15:46,112 INFO L175 Difference]: Start difference. First operand has 194 places, 239 transitions, 4592 flow. Second operand 31 states and 464 transitions. [2023-11-17 11:15:46,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 469 transitions, 7122 flow [2023-11-17 11:15:46,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 469 transitions, 6584 flow, removed 55 selfloop flow, removed 24 redundant places. [2023-11-17 11:15:46,295 INFO L231 Difference]: Finished difference. Result has 206 places, 244 transitions, 4735 flow [2023-11-17 11:15:46,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=4153, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=4735, PETRI_PLACES=206, PETRI_TRANSITIONS=244} [2023-11-17 11:15:46,296 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 182 predicate places. [2023-11-17 11:15:46,296 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 244 transitions, 4735 flow [2023-11-17 11:15:46,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.379310344827585) internal successors, (272), 29 states have internal predecessors, (272), 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-11-17 11:15:46,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:46,297 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:46,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-17 11:15:46,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 11:15:46,498 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:46,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1702219402, now seen corresponding path program 6 times [2023-11-17 11:15:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202884691] [2023-11-17 11:15:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:47,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:47,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202884691] [2023-11-17 11:15:47,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202884691] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:47,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004563803] [2023-11-17 11:15:47,274 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 11:15:47,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:47,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:47,277 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:47,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-17 11:15:47,490 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 11:15:47,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:15:47,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-17 11:15:47,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:47,540 INFO L349 Elim1Store]: treesize reduction 21, result has 48.8 percent of original size [2023-11-17 11:15:47,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 45 [2023-11-17 11:15:47,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:47,713 INFO L378 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 30 treesize of output 14 [2023-11-17 11:15:47,821 INFO L378 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 30 treesize of output 14 [2023-11-17 11:15:47,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-17 11:15:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:48,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:48,736 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (let ((.cse4 (* c_~top~0 4))) (let ((.cse0 (+ |c_~#arr~0.offset| (- 4) .cse4))) (and (or (forall ((v_ArrVal_862 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|) .cse0) 4294967296)))) (< 0 c_~top~0)) (or (let ((.cse2 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (and (or (< 1 c_~top~0) (forall ((v_ArrVal_862 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse1 .cse0) 4294967296)) (not (= (mod (select .cse1 .cse2) 4294967296) 4294967294)))))) (or (forall ((v_ArrVal_862 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|))) (or (not (= 4294967294 (mod (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 12))) 4294967296))) (= 4294967294 (mod (select .cse3 .cse0) 4294967296)) (= (mod (select .cse3 .cse2) 4294967296) 4294967294)))) (= c_~top~0 1)))) (< c_~top~0 1) (< 2147483648 c_~top~0)))))) is different from false [2023-11-17 11:15:48,803 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (let ((.cse4 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (+ |c_~#arr~0.offset| .cse4))) (and (or (< 0 (+ c_~top~0 1)) (forall ((v_ArrVal_860 Int) (v_ArrVal_862 (Array Int Int))) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|) .cse1) 4294967296))))) (or (< c_~top~0 0) (let ((.cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (and (or (= c_~top~0 0) (forall ((v_ArrVal_860 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|))) (or (= (mod (select .cse2 .cse3) 4294967296) 4294967294) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| .cse4 (- 8))) 4294967296))) (= 4294967294 (mod (select .cse2 .cse1) 4294967296)))))) (or (< 0 c_~top~0) (forall ((v_ArrVal_860 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse5 .cse1) 4294967296)) (not (= (mod (select .cse5 .cse3) 4294967296) 4294967294)))))))))))) (= 5 c_~top~0) (< 2147483647 c_~top~0)) is different from false [2023-11-17 11:15:48,919 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (let ((.cse4 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (+ |c_~#arr~0.offset| .cse4))) (and (or (< 0 (+ c_~top~0 1)) (forall ((v_ArrVal_860 Int) (v_ArrVal_862 (Array Int Int))) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|) .cse1) 4294967296))))) (or (< c_~top~0 0) (let ((.cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (and (or (= c_~top~0 0) (forall ((v_ArrVal_860 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|))) (or (= (mod (select .cse2 .cse3) 4294967296) 4294967294) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| .cse4 (- 8))) 4294967296))) (= 4294967294 (mod (select .cse2 .cse1) 4294967296)))))) (or (< 0 c_~top~0) (forall ((v_ArrVal_860 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse5 .cse1) 4294967296)) (not (= (mod (select .cse5 .cse3) 4294967296) 4294967294)))))))))))) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= 5 c_~top~0) (< 2147483647 c_~top~0)) is different from false [2023-11-17 11:15:48,983 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (< 2147483646 c_~top~0) (= 5 c_~top~0) (= c_~top~0 4) (let ((.cse6 (* c_~top~0 4))) (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (+ |c_~#arr~0.offset| .cse6)) (.cse1 (+ |c_~#arr~0.offset| .cse6 4))) (and (let ((.cse4 (+ c_~top~0 1))) (or (and (or (forall ((v_ArrVal_860 Int) (v_ArrVal_859 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse3 .cse2 v_ArrVal_859) .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse0 .cse1) 4294967296)) (not (= 4294967294 (mod (select .cse0 .cse2) 4294967296)))))) (< 0 .cse4)) (or (= .cse4 0) (forall ((v_ArrVal_860 Int) (v_ArrVal_859 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse3 .cse2 v_ArrVal_859) .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse5 .cse1) 4294967296)) (= 4294967294 (mod (select .cse5 .cse2) 4294967296)) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6)) 4294967296)))))))) (< .cse4 0))) (or (< 0 (+ 2 c_~top~0)) (forall ((v_ArrVal_860 Int) (v_ArrVal_859 Int) (v_ArrVal_862 (Array Int Int))) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse3 .cse2 v_ArrVal_859) .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|) .cse1) 4294967296))))))))) is different from false [2023-11-17 11:15:49,114 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (< 2147483646 c_~top~0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= 5 c_~top~0) (= c_~top~0 4) (let ((.cse6 (* c_~top~0 4))) (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (+ |c_~#arr~0.offset| .cse6)) (.cse1 (+ |c_~#arr~0.offset| .cse6 4))) (and (let ((.cse4 (+ c_~top~0 1))) (or (and (or (forall ((v_ArrVal_860 Int) (v_ArrVal_859 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse3 .cse2 v_ArrVal_859) .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse0 .cse1) 4294967296)) (not (= 4294967294 (mod (select .cse0 .cse2) 4294967296)))))) (< 0 .cse4)) (or (= .cse4 0) (forall ((v_ArrVal_860 Int) (v_ArrVal_859 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse3 .cse2 v_ArrVal_859) .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse5 .cse1) 4294967296)) (= 4294967294 (mod (select .cse5 .cse2) 4294967296)) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6)) 4294967296)))))))) (< .cse4 0))) (or (< 0 (+ 2 c_~top~0)) (forall ((v_ArrVal_860 Int) (v_ArrVal_859 Int) (v_ArrVal_862 (Array Int Int))) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse3 .cse2 v_ArrVal_859) .cse1 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_862) |c_~#arr~0.base|) .cse1) 4294967296))))))))) is different from false [2023-11-17 11:15:49,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:49,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 310 treesize of output 278 [2023-11-17 11:15:49,245 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:49,248 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 164 [2023-11-17 11:15:49,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 254 treesize of output 235 [2023-11-17 11:15:49,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 168 [2023-11-17 11:15:49,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 165 [2023-11-17 11:15:49,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:49,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 194 [2023-11-17 11:15:49,285 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 11:15:49,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 169 [2023-11-17 11:15:49,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:49,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 163 [2023-11-17 11:15:49,309 INFO L378 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 156 treesize of output 149 [2023-11-17 11:15:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-17 11:15:49,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004563803] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:49,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:49,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2023-11-17 11:15:49,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789156710] [2023-11-17 11:15:49,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:49,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-17 11:15:49,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:49,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-17 11:15:49,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=458, Unknown=5, NotChecked=240, Total=812 [2023-11-17 11:15:49,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:49,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 244 transitions, 4735 flow. Second operand has 29 states, 29 states have (on average 9.379310344827585) internal successors, (272), 29 states have internal predecessors, (272), 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-11-17 11:15:49,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:49,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:49,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:54,660 INFO L124 PetriNetUnfolderBase]: 2736/5533 cut-off events. [2023-11-17 11:15:54,661 INFO L125 PetriNetUnfolderBase]: For 47461/47461 co-relation queries the response was YES. [2023-11-17 11:15:54,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25055 conditions, 5533 events. 2736/5533 cut-off events. For 47461/47461 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 38746 event pairs, 405 based on Foata normal form. 38/5565 useless extension candidates. Maximal degree in co-relation 24928. Up to 1123 conditions per place. [2023-11-17 11:15:54,693 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 202 selfloop transitions, 241 changer transitions 55/498 dead transitions. [2023-11-17 11:15:54,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 498 transitions, 7571 flow [2023-11-17 11:15:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 11:15:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-11-17 11:15:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 529 transitions. [2023-11-17 11:15:54,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24221611721611722 [2023-11-17 11:15:54,696 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 529 transitions. [2023-11-17 11:15:54,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 529 transitions. [2023-11-17 11:15:54,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:54,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 529 transitions. [2023-11-17 11:15:54,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 13.564102564102564) internal successors, (529), 39 states have internal predecessors, (529), 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-11-17 11:15:54,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 56.0) internal successors, (2240), 40 states have internal predecessors, (2240), 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-11-17 11:15:54,700 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 56.0) internal successors, (2240), 40 states have internal predecessors, (2240), 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-11-17 11:15:54,700 INFO L175 Difference]: Start difference. First operand has 206 places, 244 transitions, 4735 flow. Second operand 39 states and 529 transitions. [2023-11-17 11:15:54,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 498 transitions, 7571 flow [2023-11-17 11:15:54,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 498 transitions, 7406 flow, removed 21 selfloop flow, removed 14 redundant places. [2023-11-17 11:15:54,880 INFO L231 Difference]: Finished difference. Result has 246 places, 324 transitions, 6361 flow [2023-11-17 11:15:54,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=4589, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=6361, PETRI_PLACES=246, PETRI_TRANSITIONS=324} [2023-11-17 11:15:54,881 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 222 predicate places. [2023-11-17 11:15:54,881 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 324 transitions, 6361 flow [2023-11-17 11:15:54,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.379310344827585) internal successors, (272), 29 states have internal predecessors, (272), 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-11-17 11:15:54,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:54,882 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:54,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-17 11:15:55,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-17 11:15:55,082 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:55,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:55,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1396329603, now seen corresponding path program 7 times [2023-11-17 11:15:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:55,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950821340] [2023-11-17 11:15:55,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:56,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:56,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950821340] [2023-11-17 11:15:56,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950821340] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:56,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573215192] [2023-11-17 11:15:56,004 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 11:15:56,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:56,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:56,005 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:56,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-17 11:15:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:56,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-17 11:15:56,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:56,242 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:15:56,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:15:56,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 11:15:56,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:15:56,457 INFO L378 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 30 treesize of output 14 [2023-11-17 11:15:56,569 INFO L378 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 30 treesize of output 14 [2023-11-17 11:15:56,643 INFO L378 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 23 treesize of output 16 [2023-11-17 11:15:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:56,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:57,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~top~0 4))) (let ((.cse0 (+ |c_~#arr~0.offset| (- 4) .cse4))) (and (or (forall ((v_ArrVal_959 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|) .cse0) 4294967296)))) (< 0 c_~top~0)) (or (let ((.cse2 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (and (or (< 1 c_~top~0) (forall ((v_ArrVal_959 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse1 .cse0) 4294967296)) (not (= 4294967294 (mod (select .cse1 .cse2) 4294967296))))))) (or (= c_~top~0 1) (forall ((v_ArrVal_959 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse3 .cse0) 4294967296)) (not (= (mod (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 12))) 4294967296) 4294967294)) (= 4294967294 (mod (select .cse3 .cse2) 4294967296)))))))) (< c_~top~0 1) (< 2147483648 c_~top~0))))) is different from false [2023-11-17 11:15:57,428 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse4 (* c_~top~0 4))) (let ((.cse0 (+ |c_~#arr~0.offset| (- 4) .cse4))) (and (or (forall ((v_ArrVal_959 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|) .cse0) 4294967296)))) (< 0 c_~top~0)) (or (let ((.cse2 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (and (or (< 1 c_~top~0) (forall ((v_ArrVal_959 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse1 .cse0) 4294967296)) (not (= 4294967294 (mod (select .cse1 .cse2) 4294967296))))))) (or (= c_~top~0 1) (forall ((v_ArrVal_959 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse3 .cse0) 4294967296)) (not (= (mod (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 12))) 4294967296) 4294967294)) (= 4294967294 (mod (select .cse3 .cse2) 4294967296)))))))) (< c_~top~0 1) (< 2147483648 c_~top~0))))) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0)) is different from false [2023-11-17 11:15:57,712 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (let ((.cse5 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (+ |c_~#arr~0.offset| .cse5))) (and (or (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 Int)) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 .cse1 v_ArrVal_958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|) .cse1) 4294967296) 4294967294))) (< 0 (+ c_~top~0 1))) (or (< c_~top~0 0) (let ((.cse3 (+ |c_~#arr~0.offset| (- 4) .cse5))) (and (or (< 0 c_~top~0) (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 .cse1 v_ArrVal_958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|))) (or (= (mod (select .cse2 .cse1) 4294967296) 4294967294) (not (= 4294967294 (mod (select .cse2 .cse3) 4294967296))))))) (or (= c_~top~0 0) (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 Int)) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse0 .cse1 v_ArrVal_958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|))) (or (= (mod (select .cse4 .cse1) 4294967296) 4294967294) (= 4294967294 (mod (select .cse4 .cse3) 4294967296)) (not (= (mod (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))) 4294967296) 4294967294)))))))))))) (= 5 c_~top~0) (< 2147483647 c_~top~0)) is different from false [2023-11-17 11:15:57,789 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (< 2147483646 c_~top~0) (let ((.cse6 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (+ |c_~#arr~0.offset| .cse6)) (.cse2 (+ |c_~#arr~0.offset| .cse6 4))) (and (or (< 0 (+ 2 c_~top~0)) (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int)) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse0 .cse1 v_ArrVal_956) .cse2 v_ArrVal_958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294)))) (let ((.cse4 (+ c_~top~0 1))) (or (and (or (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse0 .cse1 v_ArrVal_956) .cse2 v_ArrVal_958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|))) (or (not (= 4294967294 (mod (select .cse3 .cse1) 4294967296))) (= (mod (select .cse3 .cse2) 4294967296) 4294967294)))) (< 0 .cse4)) (or (= .cse4 0) (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse0 .cse1 v_ArrVal_956) .cse2 v_ArrVal_958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|))) (or (not (= (mod (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6)) 4294967296) 4294967294)) (= 4294967294 (mod (select .cse5 .cse1) 4294967296)) (= (mod (select .cse5 .cse2) 4294967296) 4294967294)))))) (< .cse4 0)))))) (= 5 c_~top~0) (= c_~top~0 4)) is different from false [2023-11-17 11:15:57,899 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (< 2147483646 c_~top~0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (let ((.cse6 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (+ |c_~#arr~0.offset| .cse6)) (.cse2 (+ |c_~#arr~0.offset| .cse6 4))) (and (or (< 0 (+ 2 c_~top~0)) (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int)) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse0 .cse1 v_ArrVal_956) .cse2 v_ArrVal_958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294)))) (let ((.cse4 (+ c_~top~0 1))) (or (and (or (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse0 .cse1 v_ArrVal_956) .cse2 v_ArrVal_958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|))) (or (not (= 4294967294 (mod (select .cse3 .cse1) 4294967296))) (= (mod (select .cse3 .cse2) 4294967296) 4294967294)))) (< 0 .cse4)) (or (= .cse4 0) (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse0 .cse1 v_ArrVal_956) .cse2 v_ArrVal_958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_959) |c_~#arr~0.base|))) (or (not (= (mod (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6)) 4294967296) 4294967294)) (= 4294967294 (mod (select .cse5 .cse1) 4294967296)) (= (mod (select .cse5 .cse2) 4294967296) 4294967294)))))) (< .cse4 0)))))) (= 5 c_~top~0) (= c_~top~0 4)) is different from false [2023-11-17 11:15:58,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:58,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 55 [2023-11-17 11:15:58,404 INFO L378 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 36 treesize of output 29 [2023-11-17 11:15:58,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:58,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2023-11-17 11:15:58,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:58,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 95 [2023-11-17 11:15:58,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 56 [2023-11-17 11:15:58,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:58,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 41 [2023-11-17 11:15:58,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:58,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 75 [2023-11-17 11:15:58,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 46 [2023-11-17 11:15:58,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:15:58,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2023-11-17 11:15:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 6 times theorem prover too weak. 0 trivial. 12 not checked. [2023-11-17 11:15:58,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573215192] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:58,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:58,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 31 [2023-11-17 11:15:58,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365039751] [2023-11-17 11:15:58,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:58,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 11:15:58,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:58,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 11:15:58,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=633, Unknown=17, NotChecked=280, Total=1056 [2023-11-17 11:15:58,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:15:58,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 324 transitions, 6361 flow. Second operand has 33 states, 33 states have (on average 9.363636363636363) internal successors, (309), 33 states have internal predecessors, (309), 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-11-17 11:15:58,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:58,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:15:58,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:16:05,204 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-11-17 11:16:08,876 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-11-17 11:16:10,903 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-11-17 11:16:16,551 INFO L124 PetriNetUnfolderBase]: 2590/5315 cut-off events. [2023-11-17 11:16:16,552 INFO L125 PetriNetUnfolderBase]: For 120957/120957 co-relation queries the response was YES. [2023-11-17 11:16:16,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43481 conditions, 5315 events. 2590/5315 cut-off events. For 120957/120957 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 37755 event pairs, 303 based on Foata normal form. 26/5341 useless extension candidates. Maximal degree in co-relation 42281. Up to 2711 conditions per place. [2023-11-17 11:16:16,600 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 262 selfloop transitions, 277 changer transitions 18/557 dead transitions. [2023-11-17 11:16:16,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 557 transitions, 10499 flow [2023-11-17 11:16:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 11:16:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-17 11:16:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 567 transitions. [2023-11-17 11:16:16,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24107142857142858 [2023-11-17 11:16:16,605 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 567 transitions. [2023-11-17 11:16:16,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 567 transitions. [2023-11-17 11:16:16,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:16:16,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 567 transitions. [2023-11-17 11:16:16,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 13.5) internal successors, (567), 42 states have internal predecessors, (567), 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-11-17 11:16:16,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 56.0) internal successors, (2408), 43 states have internal predecessors, (2408), 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-11-17 11:16:16,616 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 56.0) internal successors, (2408), 43 states have internal predecessors, (2408), 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-11-17 11:16:16,616 INFO L175 Difference]: Start difference. First operand has 246 places, 324 transitions, 6361 flow. Second operand 42 states and 567 transitions. [2023-11-17 11:16:16,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 557 transitions, 10499 flow [2023-11-17 11:16:17,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 557 transitions, 9990 flow, removed 79 selfloop flow, removed 11 redundant places. [2023-11-17 11:16:17,100 INFO L231 Difference]: Finished difference. Result has 287 places, 381 transitions, 7745 flow [2023-11-17 11:16:17,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=5855, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=7745, PETRI_PLACES=287, PETRI_TRANSITIONS=381} [2023-11-17 11:16:17,101 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 263 predicate places. [2023-11-17 11:16:17,101 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 381 transitions, 7745 flow [2023-11-17 11:16:17,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 9.363636363636363) internal successors, (309), 33 states have internal predecessors, (309), 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-11-17 11:16:17,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:16:17,102 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:16:17,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-17 11:16:17,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-17 11:16:17,302 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:16:17,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:16:17,303 INFO L85 PathProgramCache]: Analyzing trace with hash 671840, now seen corresponding path program 8 times [2023-11-17 11:16:17,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:16:17,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041311546] [2023-11-17 11:16:17,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:16:17,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:16:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:16:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:16:18,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:16:18,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041311546] [2023-11-17 11:16:18,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041311546] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:16:18,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926353890] [2023-11-17 11:16:18,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 11:16:18,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:16:18,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:16:18,433 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:16:18,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-17 11:16:18,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 11:16:18,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:16:18,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-17 11:16:18,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:16:18,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-17 11:16:18,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:16:18,912 INFO L378 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 46 treesize of output 18 [2023-11-17 11:16:19,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 11:16:19,124 INFO L378 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 48 treesize of output 19 [2023-11-17 11:16:19,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 31 [2023-11-17 11:16:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:16:20,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:16:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:16:21,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926353890] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:16:21,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:16:21,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 33 [2023-11-17 11:16:21,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277276848] [2023-11-17 11:16:21,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:16:21,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-17 11:16:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:16:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-17 11:16:21,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2023-11-17 11:16:21,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:16:21,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 381 transitions, 7745 flow. Second operand has 35 states, 35 states have (on average 9.485714285714286) internal successors, (332), 35 states have internal predecessors, (332), 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-11-17 11:16:21,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:16:21,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:16:21,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:16:28,018 INFO L124 PetriNetUnfolderBase]: 2858/5898 cut-off events. [2023-11-17 11:16:28,018 INFO L125 PetriNetUnfolderBase]: For 241055/241055 co-relation queries the response was YES. [2023-11-17 11:16:28,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59096 conditions, 5898 events. 2858/5898 cut-off events. For 241055/241055 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 43072 event pairs, 706 based on Foata normal form. 32/5930 useless extension candidates. Maximal degree in co-relation 58357. Up to 2994 conditions per place. [2023-11-17 11:16:28,075 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 346 selfloop transitions, 231 changer transitions 206/783 dead transitions. [2023-11-17 11:16:28,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 783 transitions, 15179 flow [2023-11-17 11:16:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-17 11:16:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-11-17 11:16:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 742 transitions. [2023-11-17 11:16:28,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2409090909090909 [2023-11-17 11:16:28,078 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 742 transitions. [2023-11-17 11:16:28,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 742 transitions. [2023-11-17 11:16:28,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:16:28,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 742 transitions. [2023-11-17 11:16:28,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 13.49090909090909) internal successors, (742), 55 states have internal predecessors, (742), 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-11-17 11:16:28,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 56.0) internal successors, (3136), 56 states have internal predecessors, (3136), 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-11-17 11:16:28,084 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 56.0) internal successors, (3136), 56 states have internal predecessors, (3136), 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-11-17 11:16:28,084 INFO L175 Difference]: Start difference. First operand has 287 places, 381 transitions, 7745 flow. Second operand 55 states and 742 transitions. [2023-11-17 11:16:28,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 783 transitions, 15179 flow [2023-11-17 11:16:29,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 783 transitions, 14092 flow, removed 354 selfloop flow, removed 14 redundant places. [2023-11-17 11:16:29,072 INFO L231 Difference]: Finished difference. Result has 331 places, 338 transitions, 6682 flow [2023-11-17 11:16:29,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=7085, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=6682, PETRI_PLACES=331, PETRI_TRANSITIONS=338} [2023-11-17 11:16:29,073 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 307 predicate places. [2023-11-17 11:16:29,073 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 338 transitions, 6682 flow [2023-11-17 11:16:29,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.485714285714286) internal successors, (332), 35 states have internal predecessors, (332), 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-11-17 11:16:29,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:16:29,074 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:16:29,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-17 11:16:29,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:16:29,275 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:16:29,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:16:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1057058602, now seen corresponding path program 9 times [2023-11-17 11:16:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:16:29,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497302147] [2023-11-17 11:16:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:16:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:16:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:16:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:16:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:16:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497302147] [2023-11-17 11:16:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497302147] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:16:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724440054] [2023-11-17 11:16:30,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 11:16:30,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:16:30,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:16:30,609 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:16:30,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-17 11:16:30,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-17 11:16:30,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:16:30,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-17 11:16:30,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:16:30,964 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:16:30,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:16:31,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:16:31,079 INFO L378 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 23 treesize of output 16 [2023-11-17 11:16:31,135 INFO L378 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 30 treesize of output 14 [2023-11-17 11:16:31,203 INFO L378 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 30 treesize of output 14 [2023-11-17 11:16:31,289 INFO L378 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 30 treesize of output 14 [2023-11-17 11:16:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:16:31,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:16:32,924 WARN L854 $PredicateComparison]: unable to prove that (or (= 3 c_~top~0) (= 5 c_~top~0) (and (<= 0 c_~top~0) (forall ((v_ArrVal_1163 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1163) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (= c_~top~0 4) (< (+ 2 c_~top~0) 0) (< 2147483645 c_~top~0)) is different from false [2023-11-17 11:16:32,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:16:32,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2023-11-17 11:16:32,985 INFO L378 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 64 treesize of output 40 [2023-11-17 11:16:32,989 INFO L378 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 33 treesize of output 27 [2023-11-17 11:16:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-17 11:16:33,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724440054] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:16:33,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:16:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 34 [2023-11-17 11:16:33,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744020754] [2023-11-17 11:16:33,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:16:33,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-17 11:16:33,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:16:33,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-17 11:16:33,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1030, Unknown=1, NotChecked=66, Total=1260 [2023-11-17 11:16:33,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:16:33,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 338 transitions, 6682 flow. Second operand has 36 states, 36 states have (on average 9.416666666666666) internal successors, (339), 36 states have internal predecessors, (339), 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-11-17 11:16:33,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:16:33,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:16:33,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:16:38,681 INFO L124 PetriNetUnfolderBase]: 2538/5187 cut-off events. [2023-11-17 11:16:38,681 INFO L125 PetriNetUnfolderBase]: For 208117/208117 co-relation queries the response was YES. [2023-11-17 11:16:38,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51014 conditions, 5187 events. 2538/5187 cut-off events. For 208117/208117 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 36210 event pairs, 448 based on Foata normal form. 26/5213 useless extension candidates. Maximal degree in co-relation 50935. Up to 2570 conditions per place. [2023-11-17 11:16:38,747 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 416 selfloop transitions, 156 changer transitions 148/720 dead transitions. [2023-11-17 11:16:38,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 720 transitions, 13455 flow [2023-11-17 11:16:38,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-17 11:16:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-11-17 11:16:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 748 transitions. [2023-11-17 11:16:38,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2023-11-17 11:16:38,750 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 748 transitions. [2023-11-17 11:16:38,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 748 transitions. [2023-11-17 11:16:38,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:16:38,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 748 transitions. [2023-11-17 11:16:38,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 14.666666666666666) internal successors, (748), 51 states have internal predecessors, (748), 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-11-17 11:16:38,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 56.0) internal successors, (2912), 52 states have internal predecessors, (2912), 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-11-17 11:16:38,756 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 56.0) internal successors, (2912), 52 states have internal predecessors, (2912), 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-11-17 11:16:38,756 INFO L175 Difference]: Start difference. First operand has 331 places, 338 transitions, 6682 flow. Second operand 51 states and 748 transitions. [2023-11-17 11:16:38,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 720 transitions, 13455 flow [2023-11-17 11:16:39,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 720 transitions, 12645 flow, removed 56 selfloop flow, removed 33 redundant places. [2023-11-17 11:16:39,931 INFO L231 Difference]: Finished difference. Result has 339 places, 357 transitions, 6564 flow [2023-11-17 11:16:39,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=5972, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=6564, PETRI_PLACES=339, PETRI_TRANSITIONS=357} [2023-11-17 11:16:39,932 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 315 predicate places. [2023-11-17 11:16:39,932 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 357 transitions, 6564 flow [2023-11-17 11:16:39,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.416666666666666) internal successors, (339), 36 states have internal predecessors, (339), 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-11-17 11:16:39,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:16:39,932 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:16:39,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-17 11:16:40,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:16:40,133 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:16:40,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:16:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash -169312732, now seen corresponding path program 10 times [2023-11-17 11:16:40,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:16:40,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480360169] [2023-11-17 11:16:40,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:16:40,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:16:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:16:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:16:41,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:16:41,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480360169] [2023-11-17 11:16:41,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480360169] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:16:41,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324080924] [2023-11-17 11:16:41,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 11:16:41,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:16:41,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:16:41,433 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:16:41,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-17 11:16:41,607 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 11:16:41,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:16:41,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-17 11:16:41,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:16:41,629 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:16:41,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:16:41,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:16:41,722 INFO L378 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 30 treesize of output 14 [2023-11-17 11:16:41,763 INFO L378 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 23 treesize of output 16 [2023-11-17 11:16:41,849 INFO L378 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 30 treesize of output 14 [2023-11-17 11:16:41,925 INFO L378 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 30 treesize of output 14 [2023-11-17 11:16:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:16:42,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:16:43,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:16:43,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 60 [2023-11-17 11:16:43,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:16:43,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 61 [2023-11-17 11:16:43,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:16:43,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 32 [2023-11-17 11:16:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:16:43,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324080924] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:16:43,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:16:43,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 34 [2023-11-17 11:16:43,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921611241] [2023-11-17 11:16:43,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:16:43,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-17 11:16:43,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:16:43,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-17 11:16:43,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=997, Unknown=1, NotChecked=0, Total=1260 [2023-11-17 11:16:43,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:16:43,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 357 transitions, 6564 flow. Second operand has 36 states, 36 states have (on average 9.416666666666666) internal successors, (339), 36 states have internal predecessors, (339), 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-11-17 11:16:43,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:16:43,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:16:43,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:16:45,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:16:47,920 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-11-17 11:16:49,951 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-11-17 11:16:56,776 INFO L124 PetriNetUnfolderBase]: 2437/4983 cut-off events. [2023-11-17 11:16:56,776 INFO L125 PetriNetUnfolderBase]: For 244189/244189 co-relation queries the response was YES. [2023-11-17 11:16:56,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53172 conditions, 4983 events. 2437/4983 cut-off events. For 244189/244189 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 34022 event pairs, 378 based on Foata normal form. 44/5027 useless extension candidates. Maximal degree in co-relation 53090. Up to 2495 conditions per place. [2023-11-17 11:16:56,825 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 388 selfloop transitions, 115 changer transitions 235/738 dead transitions. [2023-11-17 11:16:56,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 738 transitions, 14136 flow [2023-11-17 11:16:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-11-17 11:16:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-11-17 11:16:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 810 transitions. [2023-11-17 11:16:56,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25375939849624063 [2023-11-17 11:16:56,827 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 810 transitions. [2023-11-17 11:16:56,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 810 transitions. [2023-11-17 11:16:56,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:16:56,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 810 transitions. [2023-11-17 11:16:56,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 14.210526315789474) internal successors, (810), 57 states have internal predecessors, (810), 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-11-17 11:16:56,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 56.0) internal successors, (3248), 58 states have internal predecessors, (3248), 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-11-17 11:16:56,832 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 56.0) internal successors, (3248), 58 states have internal predecessors, (3248), 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-11-17 11:16:56,832 INFO L175 Difference]: Start difference. First operand has 339 places, 357 transitions, 6564 flow. Second operand 57 states and 810 transitions. [2023-11-17 11:16:56,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 738 transitions, 14136 flow [2023-11-17 11:16:57,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 738 transitions, 13560 flow, removed 205 selfloop flow, removed 24 redundant places. [2023-11-17 11:16:57,772 INFO L231 Difference]: Finished difference. Result has 371 places, 289 transitions, 4985 flow [2023-11-17 11:16:57,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=6066, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=4985, PETRI_PLACES=371, PETRI_TRANSITIONS=289} [2023-11-17 11:16:57,773 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 347 predicate places. [2023-11-17 11:16:57,773 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 289 transitions, 4985 flow [2023-11-17 11:16:57,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.416666666666666) internal successors, (339), 36 states have internal predecessors, (339), 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-11-17 11:16:57,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:16:57,774 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:16:57,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-17 11:16:57,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:16:57,977 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:16:57,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:16:57,977 INFO L85 PathProgramCache]: Analyzing trace with hash -86658552, now seen corresponding path program 11 times [2023-11-17 11:16:57,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:16:57,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269962387] [2023-11-17 11:16:57,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:16:57,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:16:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:16:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:16:58,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:16:58,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269962387] [2023-11-17 11:16:58,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269962387] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:16:58,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478244106] [2023-11-17 11:16:58,908 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 11:16:58,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:16:58,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:16:58,913 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:16:58,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-17 11:16:59,190 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-17 11:16:59,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:16:59,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-17 11:16:59,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:16:59,323 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 11:16:59,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-17 11:16:59,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:16:59,465 INFO L378 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 30 treesize of output 14 [2023-11-17 11:16:59,555 INFO L378 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 30 treesize of output 14 [2023-11-17 11:16:59,592 INFO L378 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 23 treesize of output 16 [2023-11-17 11:16:59,681 INFO L378 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 30 treesize of output 14 [2023-11-17 11:17:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:00,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:17:01,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:01,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 90 [2023-11-17 11:17:01,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:01,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 87 [2023-11-17 11:17:01,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:01,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 41 [2023-11-17 11:17:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478244106] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:17:01,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:17:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 34 [2023-11-17 11:17:01,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229017168] [2023-11-17 11:17:01,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:17:01,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-17 11:17:01,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:17:01,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-17 11:17:01,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=955, Unknown=1, NotChecked=0, Total=1260 [2023-11-17 11:17:01,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:17:01,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 289 transitions, 4985 flow. Second operand has 36 states, 36 states have (on average 9.416666666666666) internal successors, (339), 36 states have internal predecessors, (339), 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-11-17 11:17:01,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:17:01,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:17:01,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:17:03,868 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-11-17 11:17:05,877 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-11-17 11:17:07,909 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-11-17 11:17:10,109 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-11-17 11:17:14,832 INFO L124 PetriNetUnfolderBase]: 2003/4038 cut-off events. [2023-11-17 11:17:14,832 INFO L125 PetriNetUnfolderBase]: For 192220/192220 co-relation queries the response was YES. [2023-11-17 11:17:14,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42768 conditions, 4038 events. 2003/4038 cut-off events. For 192220/192220 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 25889 event pairs, 255 based on Foata normal form. 26/4064 useless extension candidates. Maximal degree in co-relation 42680. Up to 2000 conditions per place. [2023-11-17 11:17:14,869 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 273 selfloop transitions, 95 changer transitions 171/539 dead transitions. [2023-11-17 11:17:14,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 539 transitions, 10298 flow [2023-11-17 11:17:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-17 11:17:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-11-17 11:17:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 607 transitions. [2023-11-17 11:17:14,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2520764119601329 [2023-11-17 11:17:14,871 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 607 transitions. [2023-11-17 11:17:14,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 607 transitions. [2023-11-17 11:17:14,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:17:14,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 607 transitions. [2023-11-17 11:17:14,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 14.116279069767442) internal successors, (607), 43 states have internal predecessors, (607), 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-11-17 11:17:14,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 56.0) internal successors, (2464), 44 states have internal predecessors, (2464), 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-11-17 11:17:14,875 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 56.0) internal successors, (2464), 44 states have internal predecessors, (2464), 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-11-17 11:17:14,875 INFO L175 Difference]: Start difference. First operand has 371 places, 289 transitions, 4985 flow. Second operand 43 states and 607 transitions. [2023-11-17 11:17:14,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 539 transitions, 10298 flow [2023-11-17 11:17:15,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 539 transitions, 8970 flow, removed 244 selfloop flow, removed 74 redundant places. [2023-11-17 11:17:15,559 INFO L231 Difference]: Finished difference. Result has 309 places, 226 transitions, 3220 flow [2023-11-17 11:17:15,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=4025, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=3220, PETRI_PLACES=309, PETRI_TRANSITIONS=226} [2023-11-17 11:17:15,559 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 285 predicate places. [2023-11-17 11:17:15,559 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 226 transitions, 3220 flow [2023-11-17 11:17:15,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.416666666666666) internal successors, (339), 36 states have internal predecessors, (339), 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-11-17 11:17:15,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:15,560 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:17:15,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-17 11:17:15,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:17:15,761 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:17:15,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1297135868, now seen corresponding path program 12 times [2023-11-17 11:17:15,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:15,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901564136] [2023-11-17 11:17:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:15,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:16,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:17:16,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901564136] [2023-11-17 11:17:16,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901564136] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:17:16,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441630966] [2023-11-17 11:17:16,864 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 11:17:16,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:17:16,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:17:16,869 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:17:16,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-17 11:17:17,186 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-17 11:17:17,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:17:17,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-17 11:17:17,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:17:17,217 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:17:17,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:17:17,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:17:17,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2023-11-17 11:17:17,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2023-11-17 11:17:17,490 INFO L378 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 34 treesize of output 14 [2023-11-17 11:17:17,566 INFO L378 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 41 treesize of output 30 [2023-11-17 11:17:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:17,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:17:19,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:19,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 213 treesize of output 120 [2023-11-17 11:17:19,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:19,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 119 [2023-11-17 11:17:19,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:19,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 50 [2023-11-17 11:17:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:19,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441630966] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:17:19,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:17:19,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 36 [2023-11-17 11:17:19,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054916304] [2023-11-17 11:17:19,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:17:19,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-17 11:17:19,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:17:19,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-17 11:17:19,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1099, Unknown=5, NotChecked=0, Total=1406 [2023-11-17 11:17:19,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:17:19,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 226 transitions, 3220 flow. Second operand has 38 states, 38 states have (on average 9.289473684210526) internal successors, (353), 38 states have internal predecessors, (353), 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-11-17 11:17:19,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:17:19,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:17:19,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:17:23,966 INFO L124 PetriNetUnfolderBase]: 1598/3197 cut-off events. [2023-11-17 11:17:23,966 INFO L125 PetriNetUnfolderBase]: For 110210/110210 co-relation queries the response was YES. [2023-11-17 11:17:23,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30666 conditions, 3197 events. 1598/3197 cut-off events. For 110210/110210 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 19080 event pairs, 173 based on Foata normal form. 20/3217 useless extension candidates. Maximal degree in co-relation 30596. Up to 1582 conditions per place. [2023-11-17 11:17:23,995 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 178 selfloop transitions, 91 changer transitions 85/354 dead transitions. [2023-11-17 11:17:23,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 354 transitions, 5994 flow [2023-11-17 11:17:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 11:17:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-17 11:17:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 338 transitions. [2023-11-17 11:17:23,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26242236024844723 [2023-11-17 11:17:23,996 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 338 transitions. [2023-11-17 11:17:23,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 338 transitions. [2023-11-17 11:17:23,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:17:23,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 338 transitions. [2023-11-17 11:17:23,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 14.695652173913043) internal successors, (338), 23 states have internal predecessors, (338), 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-11-17 11:17:23,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 56.0) internal successors, (1344), 24 states have internal predecessors, (1344), 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-11-17 11:17:23,999 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 56.0) internal successors, (1344), 24 states have internal predecessors, (1344), 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-11-17 11:17:23,999 INFO L175 Difference]: Start difference. First operand has 309 places, 226 transitions, 3220 flow. Second operand 23 states and 338 transitions. [2023-11-17 11:17:23,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 354 transitions, 5994 flow [2023-11-17 11:17:24,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 354 transitions, 5072 flow, removed 166 selfloop flow, removed 52 redundant places. [2023-11-17 11:17:24,235 INFO L231 Difference]: Finished difference. Result has 234 places, 191 transitions, 2400 flow [2023-11-17 11:17:24,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2536, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2400, PETRI_PLACES=234, PETRI_TRANSITIONS=191} [2023-11-17 11:17:24,235 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 210 predicate places. [2023-11-17 11:17:24,235 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 191 transitions, 2400 flow [2023-11-17 11:17:24,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 9.289473684210526) internal successors, (353), 38 states have internal predecessors, (353), 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-11-17 11:17:24,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:24,236 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:17:24,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-17 11:17:24,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:17:24,436 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:17:24,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1796890106, now seen corresponding path program 1 times [2023-11-17 11:17:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:24,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753235947] [2023-11-17 11:17:24,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:25,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:17:25,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753235947] [2023-11-17 11:17:25,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753235947] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:17:25,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140517472] [2023-11-17 11:17:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:25,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:17:25,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:17:25,201 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:17:25,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-17 11:17:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:25,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-17 11:17:25,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:17:25,475 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:17:25,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:17:25,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 11:17:25,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 11:17:25,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:17:25,753 INFO L378 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 30 treesize of output 14 [2023-11-17 11:17:25,854 INFO L378 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 30 treesize of output 14 [2023-11-17 11:17:25,926 INFO L378 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 23 treesize of output 16 [2023-11-17 11:17:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:26,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:17:26,532 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~top~0 4))) (let ((.cse0 (+ |c_~#arr~0.offset| (- 4) .cse4))) (and (or (forall ((v_ArrVal_1597 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|) .cse0) 4294967296) 4294967294))) (< 0 c_~top~0)) (or (let ((.cse2 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (and (or (forall ((v_ArrVal_1597 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (= (mod (select .cse1 .cse0) 4294967296) 4294967294) (not (= 4294967294 (mod (select .cse1 .cse2) 4294967296)))))) (< 1 c_~top~0)) (or (forall ((v_ArrVal_1597 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (= (mod (select .cse3 .cse0) 4294967296) 4294967294) (not (= (mod (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 12))) 4294967296) 4294967294)) (= 4294967294 (mod (select .cse3 .cse2) 4294967296))))) (= c_~top~0 1)))) (< c_~top~0 1) (< 2147483648 c_~top~0))))) is different from false [2023-11-17 11:17:26,628 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (let ((.cse4 (* c_~top~0 4))) (let ((.cse0 (+ |c_~#arr~0.offset| (- 4) .cse4))) (and (or (forall ((v_ArrVal_1597 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|) .cse0) 4294967296) 4294967294))) (< 0 c_~top~0)) (or (let ((.cse2 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (and (or (forall ((v_ArrVal_1597 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (= (mod (select .cse1 .cse0) 4294967296) 4294967294) (not (= 4294967294 (mod (select .cse1 .cse2) 4294967296)))))) (< 1 c_~top~0)) (or (forall ((v_ArrVal_1597 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (= (mod (select .cse3 .cse0) 4294967296) 4294967294) (not (= (mod (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 12))) 4294967296) 4294967294)) (= 4294967294 (mod (select .cse3 .cse2) 4294967296))))) (= c_~top~0 1)))) (< c_~top~0 1) (< 2147483648 c_~top~0)))))) is different from false [2023-11-17 11:17:26,700 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (= 5 c_~top~0) (let ((.cse5 (* c_~top~0 4))) (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (+ |c_~#arr~0.offset| .cse5))) (and (or (< c_~top~0 0) (let ((.cse1 (+ |c_~#arr~0.offset| (- 4) .cse5))) (and (or (forall ((v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse3 .cse2 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (not (= (mod (select .cse0 .cse1) 4294967296) 4294967294)) (= (mod (select .cse0 .cse2) 4294967296) 4294967294)))) (< 0 c_~top~0)) (or (= c_~top~0 0) (forall ((v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse3 .cse2 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (not (= (mod (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))) 4294967296) 4294967294)) (= (mod (select .cse4 .cse2) 4294967296) 4294967294) (= (mod (select .cse4 .cse1) 4294967296) 4294967294)))))))) (or (< 0 (+ c_~top~0 1)) (forall ((v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int))) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse3 .cse2 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294))))))) (< 2147483647 c_~top~0)) is different from false [2023-11-17 11:17:26,819 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= 5 c_~top~0) (let ((.cse5 (* c_~top~0 4))) (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (+ |c_~#arr~0.offset| .cse5))) (and (or (< c_~top~0 0) (let ((.cse1 (+ |c_~#arr~0.offset| (- 4) .cse5))) (and (or (forall ((v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse3 .cse2 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (not (= (mod (select .cse0 .cse1) 4294967296) 4294967294)) (= (mod (select .cse0 .cse2) 4294967296) 4294967294)))) (< 0 c_~top~0)) (or (= c_~top~0 0) (forall ((v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse3 .cse2 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (not (= (mod (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))) 4294967296) 4294967294)) (= (mod (select .cse4 .cse2) 4294967296) 4294967294) (= (mod (select .cse4 .cse1) 4294967296) 4294967294)))))))) (or (< 0 (+ c_~top~0 1)) (forall ((v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int))) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store .cse3 .cse2 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294))))))) (< 2147483647 c_~top~0)) is different from false [2023-11-17 11:17:27,155 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (< 2147483646 c_~top~0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= 5 c_~top~0) (= c_~top~0 4) (let ((.cse6 (* c_~top~0 4))) (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (+ |c_~#arr~0.offset| .cse6)) (.cse2 (+ |c_~#arr~0.offset| .cse6 4))) (and (let ((.cse0 (+ c_~top~0 1))) (or (and (or (< 0 .cse0) (forall ((v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse4 .cse3 v_ArrVal_1594) .cse2 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (= (mod (select .cse1 .cse2) 4294967296) 4294967294) (not (= (mod (select .cse1 .cse3) 4294967296) 4294967294)))))) (or (= .cse0 0) (forall ((v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse4 .cse3 v_ArrVal_1594) .cse2 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (= (mod (select .cse5 .cse2) 4294967296) 4294967294) (= (mod (select .cse5 .cse3) 4294967296) 4294967294) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6)) 4294967296)))))))) (< .cse0 0))) (or (< 0 (+ 2 c_~top~0)) (forall ((v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int))) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store .cse4 .cse3 v_ArrVal_1594) .cse2 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294)))))))) is different from false [2023-11-17 11:17:27,542 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= 3 c_~top~0) (= 5 c_~top~0) (let ((.cse7 (* c_~top~0 4))) (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (+ |c_~#arr~0.offset| .cse7)) (.cse2 (+ |c_~#arr~0.offset| .cse7 4)) (.cse3 (+ |c_~#arr~0.offset| .cse7 8))) (and (or (forall ((v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int)) (v_z_88 Int)) (or (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store (store .cse0 .cse1 v_z_88) .cse2 v_ArrVal_1594) .cse3 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|) .cse3) 4294967296) 4294967294)) (< 4 v_z_88) (< v_z_88 0))) (< 0 (+ 3 c_~top~0))) (let ((.cse4 (+ 2 c_~top~0))) (or (and (or (< 0 .cse4) (forall ((v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int)) (v_z_88 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store (store .cse0 .cse1 v_z_88) .cse2 v_ArrVal_1594) .cse3 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (< 4 v_z_88) (< v_z_88 0) (= (mod (select .cse5 .cse3) 4294967296) 4294967294) (not (= 4294967294 (mod (select .cse5 .cse2) 4294967296))))))) (or (= .cse4 0) (forall ((v_ArrVal_1594 Int) (v_ArrVal_1595 Int) (v_ArrVal_1597 (Array Int Int)) (v_z_88 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (store (store .cse0 .cse1 v_z_88) .cse2 v_ArrVal_1594) .cse3 v_ArrVal_1595)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (= 4294967294 (mod (select .cse6 .cse2) 4294967296)) (not (= 4294967294 (mod (select .cse6 .cse1) 4294967296))) (< 4 v_z_88) (< v_z_88 0) (= (mod (select .cse6 .cse3) 4294967296) 4294967294)))))) (< .cse4 0)))))) (= c_~top~0 4) (< 2147483645 c_~top~0)) is different from false [2023-11-17 11:17:27,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:27,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 95 [2023-11-17 11:17:27,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:27,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 75 [2023-11-17 11:17:27,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:27,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 55 [2023-11-17 11:17:27,666 WARN L854 $PredicateComparison]: unable to prove that (or (< (+ c_~top~0 2147483648) 0) (< 2147483644 c_~top~0) (= 3 c_~top~0) (= 5 c_~top~0) (= 2 c_~top~0) (let ((.cse9 (* c_~top~0 4))) (let ((.cse1 (+ |c_~#arr~0.offset| .cse9 12)) (.cse2 (+ |c_~#arr~0.offset| .cse9 4))) (and (or (forall ((v_ArrVal_1597 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_18 .cse2))) (or (< 4 .cse0) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|) .cse1) 4294967296) 4294967294)) (< .cse0 0)))) (< 0 (+ c_~top~0 4))) (let ((.cse3 (+ 3 c_~top~0))) (or (< .cse3 0) (let ((.cse6 (+ |c_~#arr~0.offset| .cse9 8))) (and (or (= 0 .cse3) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_1597 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|)) (.cse4 (select v_arrayElimArr_16 .cse2))) (or (< 4 .cse4) (= 4294967294 (mod (select .cse5 .cse6) 4294967296)) (= 4294967294 (mod (select .cse5 .cse1) 4294967296)) (not (= 4294967294 (mod (select .cse5 .cse2) 4294967296))) (< .cse4 0))))) (or (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_1597 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 .cse2)) (.cse8 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1597) |c_~#arr~0.base|))) (or (< .cse7 0) (not (= (mod (select .cse8 .cse6) 4294967296) 4294967294)) (< 4 .cse7) (= (mod (select .cse8 .cse1) 4294967296) 4294967294)))) (< 0 .cse3))))))))) (= c_~top~0 4)) is different from false [2023-11-17 11:17:27,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2023-11-17 11:17:27,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:27,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 39 [2023-11-17 11:17:27,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 56 [2023-11-17 11:17:27,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:27,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 41 [2023-11-17 11:17:27,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:27,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 36 [2023-11-17 11:17:27,930 INFO L378 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 13 treesize of output 6 [2023-11-17 11:17:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 7 refuted. 6 times theorem prover too weak. 0 trivial. 29 not checked. [2023-11-17 11:17:28,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140517472] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:17:28,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:17:28,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 35 [2023-11-17 11:17:28,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38922590] [2023-11-17 11:17:28,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:17:28,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-17 11:17:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:17:28,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-17 11:17:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=694, Unknown=33, NotChecked=434, Total=1332 [2023-11-17 11:17:28,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:17:28,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 191 transitions, 2400 flow. Second operand has 37 states, 37 states have (on average 9.432432432432432) internal successors, (349), 37 states have internal predecessors, (349), 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-11-17 11:17:28,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:17:28,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:17:28,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:17:29,981 INFO L124 PetriNetUnfolderBase]: 1220/2451 cut-off events. [2023-11-17 11:17:29,981 INFO L125 PetriNetUnfolderBase]: For 55729/55729 co-relation queries the response was YES. [2023-11-17 11:17:29,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21117 conditions, 2451 events. 1220/2451 cut-off events. For 55729/55729 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 13644 event pairs, 123 based on Foata normal form. 4/2455 useless extension candidates. Maximal degree in co-relation 21058. Up to 1170 conditions per place. [2023-11-17 11:17:30,002 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 144 selfloop transitions, 105 changer transitions 4/253 dead transitions. [2023-11-17 11:17:30,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 253 transitions, 3955 flow [2023-11-17 11:17:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 11:17:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-17 11:17:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 205 transitions. [2023-11-17 11:17:30,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24404761904761904 [2023-11-17 11:17:30,003 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 205 transitions. [2023-11-17 11:17:30,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 205 transitions. [2023-11-17 11:17:30,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:17:30,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 205 transitions. [2023-11-17 11:17:30,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 13.666666666666666) internal successors, (205), 15 states have internal predecessors, (205), 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-11-17 11:17:30,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 56.0) internal successors, (896), 16 states have internal predecessors, (896), 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-11-17 11:17:30,005 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 56.0) internal successors, (896), 16 states have internal predecessors, (896), 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-11-17 11:17:30,005 INFO L175 Difference]: Start difference. First operand has 234 places, 191 transitions, 2400 flow. Second operand 15 states and 205 transitions. [2023-11-17 11:17:30,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 253 transitions, 3955 flow [2023-11-17 11:17:30,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 253 transitions, 3460 flow, removed 110 selfloop flow, removed 31 redundant places. [2023-11-17 11:17:30,074 INFO L231 Difference]: Finished difference. Result has 196 places, 190 transitions, 2256 flow [2023-11-17 11:17:30,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2046, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2256, PETRI_PLACES=196, PETRI_TRANSITIONS=190} [2023-11-17 11:17:30,074 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 172 predicate places. [2023-11-17 11:17:30,074 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 190 transitions, 2256 flow [2023-11-17 11:17:30,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.432432432432432) internal successors, (349), 37 states have internal predecessors, (349), 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-11-17 11:17:30,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:30,075 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:17:30,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-17 11:17:30,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:17:30,275 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:17:30,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash 913187734, now seen corresponding path program 13 times [2023-11-17 11:17:30,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:30,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748670511] [2023-11-17 11:17:30,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:30,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:31,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:17:31,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748670511] [2023-11-17 11:17:31,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748670511] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:17:31,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494442853] [2023-11-17 11:17:31,959 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 11:17:31,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:17:31,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:17:31,960 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:17:31,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-17 11:17:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:32,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-17 11:17:32,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:17:32,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:17:32,223 INFO L378 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 30 treesize of output 14 [2023-11-17 11:17:32,283 INFO L378 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 30 treesize of output 14 [2023-11-17 11:17:32,351 INFO L378 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 30 treesize of output 14 [2023-11-17 11:17:32,419 INFO L378 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 30 treesize of output 14 [2023-11-17 11:17:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:32,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:17:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:34,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494442853] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:17:34,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:17:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2023-11-17 11:17:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149537806] [2023-11-17 11:17:34,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:17:34,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-17 11:17:34,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:17:34,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-17 11:17:34,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=1147, Unknown=0, NotChecked=0, Total=1560 [2023-11-17 11:17:34,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:17:34,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 190 transitions, 2256 flow. Second operand has 40 states, 40 states have (on average 9.375) internal successors, (375), 40 states have internal predecessors, (375), 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-11-17 11:17:34,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:17:34,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:17:34,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:17:37,183 INFO L124 PetriNetUnfolderBase]: 1292/2595 cut-off events. [2023-11-17 11:17:37,183 INFO L125 PetriNetUnfolderBase]: For 36506/36506 co-relation queries the response was YES. [2023-11-17 11:17:37,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19464 conditions, 2595 events. 1292/2595 cut-off events. For 36506/36506 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 14399 event pairs, 172 based on Foata normal form. 12/2607 useless extension candidates. Maximal degree in co-relation 19416. Up to 1242 conditions per place. [2023-11-17 11:17:37,201 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 227 selfloop transitions, 75 changer transitions 111/413 dead transitions. [2023-11-17 11:17:37,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 413 transitions, 5926 flow [2023-11-17 11:17:37,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-17 11:17:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-11-17 11:17:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 511 transitions. [2023-11-17 11:17:37,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2534722222222222 [2023-11-17 11:17:37,202 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 511 transitions. [2023-11-17 11:17:37,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 511 transitions. [2023-11-17 11:17:37,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:17:37,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 511 transitions. [2023-11-17 11:17:37,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 14.194444444444445) internal successors, (511), 36 states have internal predecessors, (511), 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-11-17 11:17:37,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 56.0) internal successors, (2072), 37 states have internal predecessors, (2072), 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-11-17 11:17:37,205 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 56.0) internal successors, (2072), 37 states have internal predecessors, (2072), 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-11-17 11:17:37,205 INFO L175 Difference]: Start difference. First operand has 196 places, 190 transitions, 2256 flow. Second operand 36 states and 511 transitions. [2023-11-17 11:17:37,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 413 transitions, 5926 flow [2023-11-17 11:17:37,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 413 transitions, 5713 flow, removed 0 selfloop flow, removed 14 redundant places. [2023-11-17 11:17:37,243 INFO L231 Difference]: Finished difference. Result has 219 places, 180 transitions, 2104 flow [2023-11-17 11:17:37,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2047, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2104, PETRI_PLACES=219, PETRI_TRANSITIONS=180} [2023-11-17 11:17:37,243 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 195 predicate places. [2023-11-17 11:17:37,243 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 180 transitions, 2104 flow [2023-11-17 11:17:37,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 9.375) internal successors, (375), 40 states have internal predecessors, (375), 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-11-17 11:17:37,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:37,244 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:17:37,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-17 11:17:37,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-17 11:17:37,445 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:17:37,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:37,445 INFO L85 PathProgramCache]: Analyzing trace with hash -989478004, now seen corresponding path program 14 times [2023-11-17 11:17:37,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:37,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857775279] [2023-11-17 11:17:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:37,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:38,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:17:38,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857775279] [2023-11-17 11:17:38,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857775279] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:17:38,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747475922] [2023-11-17 11:17:38,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 11:17:38,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:17:38,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:17:38,660 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:17:38,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-17 11:17:38,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 11:17:38,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:17:38,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-17 11:17:38,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:17:38,952 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:17:38,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:17:39,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:17:39,101 INFO L378 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 23 treesize of output 16 [2023-11-17 11:17:39,152 INFO L378 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 30 treesize of output 14 [2023-11-17 11:17:39,215 INFO L378 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 30 treesize of output 14 [2023-11-17 11:17:39,283 INFO L378 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 30 treesize of output 14 [2023-11-17 11:17:39,351 INFO L378 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 30 treesize of output 14 [2023-11-17 11:17:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:40,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:17:41,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:17:41,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-17 11:17:41,237 INFO L378 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 59 treesize of output 35 [2023-11-17 11:17:41,240 INFO L378 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 28 treesize of output 22 [2023-11-17 11:17:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747475922] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:17:41,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:17:41,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 16] total 40 [2023-11-17 11:17:41,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809534665] [2023-11-17 11:17:41,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:17:41,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-17 11:17:41,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:17:41,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-17 11:17:41,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1258, Unknown=1, NotChecked=0, Total=1722 [2023-11-17 11:17:41,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:17:41,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 180 transitions, 2104 flow. Second operand has 42 states, 42 states have (on average 9.5) internal successors, (399), 42 states have internal predecessors, (399), 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-11-17 11:17:41,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:17:41,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:17:41,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:17:46,251 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-11-17 11:17:48,375 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-11-17 11:17:50,753 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-11-17 11:17:52,798 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-11-17 11:17:54,821 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-11-17 11:17:56,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 11:17:57,675 INFO L124 PetriNetUnfolderBase]: 1076/2169 cut-off events. [2023-11-17 11:17:57,675 INFO L125 PetriNetUnfolderBase]: For 30093/30093 co-relation queries the response was YES. [2023-11-17 11:17:57,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16129 conditions, 2169 events. 1076/2169 cut-off events. For 30093/30093 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 11756 event pairs, 139 based on Foata normal form. 12/2181 useless extension candidates. Maximal degree in co-relation 16079. Up to 1043 conditions per place. [2023-11-17 11:17:57,687 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 138 selfloop transitions, 64 changer transitions 117/319 dead transitions. [2023-11-17 11:17:57,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 319 transitions, 4620 flow [2023-11-17 11:17:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-17 11:17:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-17 11:17:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 412 transitions. [2023-11-17 11:17:57,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24523809523809523 [2023-11-17 11:17:57,689 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 412 transitions. [2023-11-17 11:17:57,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 412 transitions. [2023-11-17 11:17:57,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:17:57,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 412 transitions. [2023-11-17 11:17:57,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 13.733333333333333) internal successors, (412), 30 states have internal predecessors, (412), 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-11-17 11:17:57,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 56.0) internal successors, (1736), 31 states have internal predecessors, (1736), 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-11-17 11:17:57,691 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 56.0) internal successors, (1736), 31 states have internal predecessors, (1736), 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-11-17 11:17:57,691 INFO L175 Difference]: Start difference. First operand has 219 places, 180 transitions, 2104 flow. Second operand 30 states and 412 transitions. [2023-11-17 11:17:57,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 319 transitions, 4620 flow [2023-11-17 11:17:57,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 319 transitions, 4457 flow, removed 5 selfloop flow, removed 32 redundant places. [2023-11-17 11:17:57,719 INFO L231 Difference]: Finished difference. Result has 213 places, 140 transitions, 1661 flow [2023-11-17 11:17:57,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1661, PETRI_PLACES=213, PETRI_TRANSITIONS=140} [2023-11-17 11:17:57,720 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 189 predicate places. [2023-11-17 11:17:57,720 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 140 transitions, 1661 flow [2023-11-17 11:17:57,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 9.5) internal successors, (399), 42 states have internal predecessors, (399), 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-11-17 11:17:57,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:17:57,720 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:17:57,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-17 11:17:57,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-17 11:17:57,921 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:17:57,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:17:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1642155852, now seen corresponding path program 15 times [2023-11-17 11:17:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:17:57,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866391591] [2023-11-17 11:17:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:17:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:17:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:17:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:17:59,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:17:59,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866391591] [2023-11-17 11:17:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866391591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:17:59,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729618534] [2023-11-17 11:17:59,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 11:17:59,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:17:59,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:17:59,016 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:17:59,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-17 11:17:59,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-17 11:17:59,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:17:59,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-17 11:17:59,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:17:59,426 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:17:59,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:17:59,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:17:59,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2023-11-17 11:17:59,601 INFO L378 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 23 treesize of output 16 [2023-11-17 11:17:59,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2023-11-17 11:17:59,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2023-11-17 11:17:59,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2023-11-17 11:18:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:18:00,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:18:02,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:02,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 60 [2023-11-17 11:18:02,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:02,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 61 [2023-11-17 11:18:02,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:02,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 32 [2023-11-17 11:18:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:18:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729618534] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:18:02,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:18:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 16] total 40 [2023-11-17 11:18:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658076404] [2023-11-17 11:18:02,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:18:02,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-17 11:18:02,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:18:02,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-17 11:18:02,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1285, Unknown=2, NotChecked=0, Total=1722 [2023-11-17 11:18:02,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:18:02,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 140 transitions, 1661 flow. Second operand has 42 states, 42 states have (on average 9.5) internal successors, (399), 42 states have internal predecessors, (399), 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-11-17 11:18:02,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:18:02,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:18:02,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:18:07,037 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-11-17 11:18:08,653 INFO L124 PetriNetUnfolderBase]: 887/1793 cut-off events. [2023-11-17 11:18:08,653 INFO L125 PetriNetUnfolderBase]: For 25077/25077 co-relation queries the response was YES. [2023-11-17 11:18:08,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13280 conditions, 1793 events. 887/1793 cut-off events. For 25077/25077 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9387 event pairs, 99 based on Foata normal form. 12/1805 useless extension candidates. Maximal degree in co-relation 13230. Up to 867 conditions per place. [2023-11-17 11:18:08,666 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 100 selfloop transitions, 61 changer transitions 109/270 dead transitions. [2023-11-17 11:18:08,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 270 transitions, 3906 flow [2023-11-17 11:18:08,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 11:18:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-17 11:18:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 377 transitions. [2023-11-17 11:18:08,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23214285714285715 [2023-11-17 11:18:08,669 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 377 transitions. [2023-11-17 11:18:08,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 377 transitions. [2023-11-17 11:18:08,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:18:08,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 377 transitions. [2023-11-17 11:18:08,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 13.0) internal successors, (377), 29 states have internal predecessors, (377), 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-11-17 11:18:08,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 56.0) internal successors, (1680), 30 states have internal predecessors, (1680), 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-11-17 11:18:08,672 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 56.0) internal successors, (1680), 30 states have internal predecessors, (1680), 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-11-17 11:18:08,672 INFO L175 Difference]: Start difference. First operand has 213 places, 140 transitions, 1661 flow. Second operand 29 states and 377 transitions. [2023-11-17 11:18:08,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 270 transitions, 3906 flow [2023-11-17 11:18:08,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 270 transitions, 3610 flow, removed 36 selfloop flow, removed 43 redundant places. [2023-11-17 11:18:08,698 INFO L231 Difference]: Finished difference. Result has 183 places, 109 transitions, 1236 flow [2023-11-17 11:18:08,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1236, PETRI_PLACES=183, PETRI_TRANSITIONS=109} [2023-11-17 11:18:08,699 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 159 predicate places. [2023-11-17 11:18:08,699 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 109 transitions, 1236 flow [2023-11-17 11:18:08,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 9.5) internal successors, (399), 42 states have internal predecessors, (399), 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-11-17 11:18:08,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:18:08,699 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:18:08,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-17 11:18:08,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-17 11:18:08,900 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:18:08,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:18:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash 517430156, now seen corresponding path program 16 times [2023-11-17 11:18:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:18:08,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854216295] [2023-11-17 11:18:08,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:18:08,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:18:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:18:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:18:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:18:10,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854216295] [2023-11-17 11:18:10,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854216295] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:18:10,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194013744] [2023-11-17 11:18:10,258 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 11:18:10,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:18:10,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:18:10,261 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:18:10,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-17 11:18:10,590 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 11:18:10,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:18:10,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-17 11:18:10,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:18:10,621 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:18:10,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:18:10,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:18:10,732 INFO L378 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 30 treesize of output 14 [2023-11-17 11:18:10,805 INFO L378 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 30 treesize of output 14 [2023-11-17 11:18:10,880 INFO L378 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 23 treesize of output 16 [2023-11-17 11:18:10,934 INFO L378 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 30 treesize of output 14 [2023-11-17 11:18:11,001 INFO L378 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 30 treesize of output 14 [2023-11-17 11:18:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:18:11,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:18:12,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:12,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 90 [2023-11-17 11:18:12,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:12,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 87 [2023-11-17 11:18:12,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:12,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 41 [2023-11-17 11:18:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:18:13,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194013744] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:18:13,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:18:13,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 39 [2023-11-17 11:18:13,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094318256] [2023-11-17 11:18:13,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:18:13,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-17 11:18:13,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:18:13,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-17 11:18:13,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1218, Unknown=1, NotChecked=0, Total=1640 [2023-11-17 11:18:13,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:18:13,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 109 transitions, 1236 flow. Second operand has 41 states, 41 states have (on average 9.560975609756097) internal successors, (392), 41 states have internal predecessors, (392), 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-11-17 11:18:13,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:18:13,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:18:13,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:18:15,470 INFO L124 PetriNetUnfolderBase]: 693/1406 cut-off events. [2023-11-17 11:18:15,470 INFO L125 PetriNetUnfolderBase]: For 18946/18946 co-relation queries the response was YES. [2023-11-17 11:18:15,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10165 conditions, 1406 events. 693/1406 cut-off events. For 18946/18946 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6974 event pairs, 78 based on Foata normal form. 12/1418 useless extension candidates. Maximal degree in co-relation 10116. Up to 699 conditions per place. [2023-11-17 11:18:15,478 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 60 selfloop transitions, 31 changer transitions 101/192 dead transitions. [2023-11-17 11:18:15,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 192 transitions, 2659 flow [2023-11-17 11:18:15,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-17 11:18:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-17 11:18:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 283 transitions. [2023-11-17 11:18:15,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2297077922077922 [2023-11-17 11:18:15,479 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 283 transitions. [2023-11-17 11:18:15,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 283 transitions. [2023-11-17 11:18:15,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:18:15,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 283 transitions. [2023-11-17 11:18:15,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 12.863636363636363) internal successors, (283), 22 states have internal predecessors, (283), 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-11-17 11:18:15,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 56.0) internal successors, (1288), 23 states have internal predecessors, (1288), 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-11-17 11:18:15,482 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 56.0) internal successors, (1288), 23 states have internal predecessors, (1288), 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-11-17 11:18:15,482 INFO L175 Difference]: Start difference. First operand has 183 places, 109 transitions, 1236 flow. Second operand 22 states and 283 transitions. [2023-11-17 11:18:15,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 192 transitions, 2659 flow [2023-11-17 11:18:15,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 192 transitions, 2301 flow, removed 52 selfloop flow, removed 41 redundant places. [2023-11-17 11:18:15,509 INFO L231 Difference]: Finished difference. Result has 150 places, 63 transitions, 598 flow [2023-11-17 11:18:15,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=598, PETRI_PLACES=150, PETRI_TRANSITIONS=63} [2023-11-17 11:18:15,510 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 126 predicate places. [2023-11-17 11:18:15,510 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 63 transitions, 598 flow [2023-11-17 11:18:15,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.560975609756097) internal successors, (392), 41 states have internal predecessors, (392), 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-11-17 11:18:15,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:18:15,510 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:18:15,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-17 11:18:15,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:18:15,717 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:18:15,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:18:15,717 INFO L85 PathProgramCache]: Analyzing trace with hash 993441612, now seen corresponding path program 17 times [2023-11-17 11:18:15,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:18:15,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795720207] [2023-11-17 11:18:15,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:18:15,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:18:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:18:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:18:17,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:18:17,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795720207] [2023-11-17 11:18:17,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795720207] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:18:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4704655] [2023-11-17 11:18:17,034 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 11:18:17,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:18:17,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:18:17,037 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:18:17,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-17 11:18:17,318 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-17 11:18:17,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:18:17,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-17 11:18:17,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:18:17,346 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:18:17,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:18:17,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:18:17,473 INFO L378 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 30 treesize of output 14 [2023-11-17 11:18:17,550 INFO L378 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 30 treesize of output 14 [2023-11-17 11:18:17,637 INFO L378 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 30 treesize of output 14 [2023-11-17 11:18:17,709 INFO L378 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 23 treesize of output 16 [2023-11-17 11:18:17,756 INFO L378 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 30 treesize of output 14 [2023-11-17 11:18:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:18:18,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:18:20,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:20,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 213 treesize of output 120 [2023-11-17 11:18:20,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:20,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 113 [2023-11-17 11:18:20,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:20,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 50 [2023-11-17 11:18:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:18:20,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4704655] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:18:20,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:18:20,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 42 [2023-11-17 11:18:20,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855041579] [2023-11-17 11:18:20,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:18:20,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-17 11:18:20,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:18:20,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-17 11:18:20,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=1416, Unknown=1, NotChecked=0, Total=1892 [2023-11-17 11:18:20,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:18:20,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 63 transitions, 598 flow. Second operand has 44 states, 44 states have (on average 9.386363636363637) internal successors, (413), 44 states have internal predecessors, (413), 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-11-17 11:18:20,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:18:20,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:18:20,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:18:21,905 INFO L124 PetriNetUnfolderBase]: 429/883 cut-off events. [2023-11-17 11:18:21,905 INFO L125 PetriNetUnfolderBase]: For 9709/9709 co-relation queries the response was YES. [2023-11-17 11:18:21,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5715 conditions, 883 events. 429/883 cut-off events. For 9709/9709 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3882 event pairs, 52 based on Foata normal form. 12/895 useless extension candidates. Maximal degree in co-relation 5672. Up to 455 conditions per place. [2023-11-17 11:18:21,909 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 34 selfloop transitions, 20 changer transitions 73/127 dead transitions. [2023-11-17 11:18:21,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 127 transitions, 1520 flow [2023-11-17 11:18:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 11:18:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 11:18:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 241 transitions. [2023-11-17 11:18:21,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21517857142857144 [2023-11-17 11:18:21,910 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 241 transitions. [2023-11-17 11:18:21,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 241 transitions. [2023-11-17 11:18:21,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:18:21,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 241 transitions. [2023-11-17 11:18:21,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 12.05) internal successors, (241), 20 states have internal predecessors, (241), 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-11-17 11:18:21,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 56.0) internal successors, (1176), 21 states have internal predecessors, (1176), 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-11-17 11:18:21,913 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 56.0) internal successors, (1176), 21 states have internal predecessors, (1176), 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-11-17 11:18:21,913 INFO L175 Difference]: Start difference. First operand has 150 places, 63 transitions, 598 flow. Second operand 20 states and 241 transitions. [2023-11-17 11:18:21,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 127 transitions, 1520 flow [2023-11-17 11:18:21,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 127 transitions, 1258 flow, removed 77 selfloop flow, removed 31 redundant places. [2023-11-17 11:18:21,924 INFO L231 Difference]: Finished difference. Result has 116 places, 39 transitions, 329 flow [2023-11-17 11:18:21,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=329, PETRI_PLACES=116, PETRI_TRANSITIONS=39} [2023-11-17 11:18:21,925 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 92 predicate places. [2023-11-17 11:18:21,925 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 39 transitions, 329 flow [2023-11-17 11:18:21,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 9.386363636363637) internal successors, (413), 44 states have internal predecessors, (413), 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-11-17 11:18:21,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:18:21,925 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:18:21,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-17 11:18:22,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-17 11:18:22,129 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:18:22,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:18:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1366332058, now seen corresponding path program 18 times [2023-11-17 11:18:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:18:22,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725819445] [2023-11-17 11:18:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:18:22,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:18:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:18:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:18:23,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:18:23,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725819445] [2023-11-17 11:18:23,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725819445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:18:23,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082029718] [2023-11-17 11:18:23,698 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 11:18:23,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:18:23,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:18:23,699 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:18:23,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-17 11:18:24,284 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-17 11:18:24,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:18:24,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-17 11:18:24,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:18:24,315 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-17 11:18:24,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-17 11:18:24,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 11:18:24,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2023-11-17 11:18:24,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2023-11-17 11:18:24,601 INFO L378 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 34 treesize of output 14 [2023-11-17 11:18:24,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:24,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 29 [2023-11-17 11:18:24,793 INFO L378 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 41 treesize of output 30 [2023-11-17 11:18:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:18:25,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:18:27,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:27,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 306 treesize of output 150 [2023-11-17 11:18:27,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:27,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 223 treesize of output 145 [2023-11-17 11:18:27,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 11:18:27,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 59 [2023-11-17 11:18:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:18:27,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082029718] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:18:27,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:18:27,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 44 [2023-11-17 11:18:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683108014] [2023-11-17 11:18:27,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:18:27,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-17 11:18:27,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:18:27,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-17 11:18:27,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1673, Unknown=1, NotChecked=0, Total=2070 [2023-11-17 11:18:27,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2023-11-17 11:18:27,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 39 transitions, 329 flow. Second operand has 46 states, 46 states have (on average 9.282608695652174) internal successors, (427), 46 states have internal predecessors, (427), 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-11-17 11:18:27,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:18:27,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2023-11-17 11:18:27,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:18:29,772 INFO L124 PetriNetUnfolderBase]: 199/426 cut-off events. [2023-11-17 11:18:29,772 INFO L125 PetriNetUnfolderBase]: For 2912/2912 co-relation queries the response was YES. [2023-11-17 11:18:29,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 426 events. 199/426 cut-off events. For 2912/2912 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1458 event pairs, 25 based on Foata normal form. 12/438 useless extension candidates. Maximal degree in co-relation 2271. Up to 215 conditions per place. [2023-11-17 11:18:29,774 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 0 selfloop transitions, 0 changer transitions 75/75 dead transitions. [2023-11-17 11:18:29,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 75 transitions, 755 flow [2023-11-17 11:18:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 11:18:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-17 11:18:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 194 transitions. [2023-11-17 11:18:29,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19246031746031747 [2023-11-17 11:18:29,775 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 194 transitions. [2023-11-17 11:18:29,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 194 transitions. [2023-11-17 11:18:29,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:18:29,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 194 transitions. [2023-11-17 11:18:29,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 10.777777777777779) internal successors, (194), 18 states have internal predecessors, (194), 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-11-17 11:18:29,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 56.0) internal successors, (1064), 19 states have internal predecessors, (1064), 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-11-17 11:18:29,777 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 56.0) internal successors, (1064), 19 states have internal predecessors, (1064), 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-11-17 11:18:29,777 INFO L175 Difference]: Start difference. First operand has 116 places, 39 transitions, 329 flow. Second operand 18 states and 194 transitions. [2023-11-17 11:18:29,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 75 transitions, 755 flow [2023-11-17 11:18:29,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 75 transitions, 586 flow, removed 46 selfloop flow, removed 28 redundant places. [2023-11-17 11:18:29,782 INFO L231 Difference]: Finished difference. Result has 84 places, 0 transitions, 0 flow [2023-11-17 11:18:29,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=0, PETRI_PLACES=84, PETRI_TRANSITIONS=0} [2023-11-17 11:18:29,783 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 60 predicate places. [2023-11-17 11:18:29,783 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 0 transitions, 0 flow [2023-11-17 11:18:29,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 9.282608695652174) internal successors, (427), 46 states have internal predecessors, (427), 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-11-17 11:18:29,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-17 11:18:29,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-11-17 11:18:29,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-11-17 11:18:29,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-17 11:18:29,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-17 11:18:29,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:18:29,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-11-17 11:18:29,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-17 11:18:29,994 INFO L445 BasicCegarLoop]: Path program histogram: [18, 5, 3, 1, 1, 1] [2023-11-17 11:18:29,998 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:18:29,998 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:18:30,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:18:30 BasicIcfg [2023-11-17 11:18:30,001 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:18:30,001 INFO L158 Benchmark]: Toolchain (without parser) took 218335.43ms. Allocated memory was 284.2MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 229.2MB in the beginning and 635.7MB in the end (delta: -406.5MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2023-11-17 11:18:30,001 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:18:30,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.25ms. Allocated memory is still 284.2MB. Free memory was 229.2MB in the beginning and 199.4MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-11-17 11:18:30,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.29ms. Allocated memory is still 284.2MB. Free memory was 199.4MB in the beginning and 196.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:18:30,002 INFO L158 Benchmark]: Boogie Preprocessor took 43.52ms. Allocated memory is still 284.2MB. Free memory was 196.7MB in the beginning and 194.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:18:30,002 INFO L158 Benchmark]: RCFGBuilder took 760.74ms. Allocated memory is still 284.2MB. Free memory was 194.6MB in the beginning and 150.6MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2023-11-17 11:18:30,002 INFO L158 Benchmark]: TraceAbstraction took 216832.29ms. Allocated memory was 284.2MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 150.1MB in the beginning and 635.7MB in the end (delta: -485.7MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2023-11-17 11:18:30,003 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.13ms. Allocated memory is still 187.7MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 626.25ms. Allocated memory is still 284.2MB. Free memory was 229.2MB in the beginning and 199.4MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.29ms. Allocated memory is still 284.2MB. Free memory was 199.4MB in the beginning and 196.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.52ms. Allocated memory is still 284.2MB. Free memory was 196.7MB in the beginning and 194.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 760.74ms. Allocated memory is still 284.2MB. Free memory was 194.6MB in the beginning and 150.6MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 216832.29ms. Allocated memory was 284.2MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 150.1MB in the beginning and 635.7MB in the end (delta: -485.7MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 33 PlacesBefore, 24 PlacesAfterwards, 31 TransitionsBefore, 21 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 21 TotalNumberOfCompositions, 1099 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 687, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 323, independent: 305, independent conditional: 0, independent unconditional: 305, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 323, independent: 278, independent conditional: 0, independent unconditional: 278, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 172, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 13, unknown conditional: 0, unknown unconditional: 13] ], Cache Queries: [ total: 687, independent: 322, independent conditional: 0, independent unconditional: 322, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 327, unknown conditional: 0, unknown unconditional: 327] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1 - PositiveResult [Line: 941]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 941]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 54 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 216.7s, OverallIterations: 29, TraceHistogramMax: 6, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 139.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.1s, HoareTripleCheckerStatistics: 535 mSolverCounterUnknown, 9671 SdHoareTripleChecker+Valid, 67.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9671 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 64.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3717 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1690 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23610 IncrementalHoareTripleChecker+Invalid, 29552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1690 mSolverCounterUnsat, 0 mSDtfsCounter, 23610 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1992 GetRequests, 727 SyntacticMatches, 58 SemanticMatches, 1207 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 17740 ImplicationChecksByTransitivity, 59.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10759occurred in iteration=12, InterpolantAutomatonStates: 695, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 63.5s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 1278 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 1798 ConstructedInterpolants, 123 QuantifiedInterpolants, 71058 SizeOfPredicates, 463 NumberOfNonLiveVariables, 6567 ConjunctsInSsa, 953 ConjunctsInUnsatCore, 77 InterpolantComputations, 6 PerfectInterpolantSequences, 109/2117 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-17 11:18:30,069 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 0 Received shutdown request...