/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:31:50,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:31:51,024 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 16:31:51,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:31:51,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:31:51,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:31:51,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:31:51,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:31:51,058 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:31:51,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:31:51,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:31:51,059 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:31:51,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:31:51,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:31:51,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:31:51,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:31:51,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:31:51,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:31:51,061 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:31:51,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:31:51,061 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:31:51,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:31:51,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:31:51,062 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:31:51,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:31:51,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:31:51,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:31:51,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:31:51,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:31:51,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:31:51,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:31:51,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:31:51,065 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 [2023-11-17 16:31:51,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:31:51,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:31:51,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:31:51,328 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:31:51,328 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:31:51,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-11-17 16:31:52,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:31:52,661 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:31:52,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-11-17 16:31:52,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e30670e/f8b47710a492497e923e0d2be14e3d27/FLAG63801e7cd [2023-11-17 16:31:52,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e30670e/f8b47710a492497e923e0d2be14e3d27 [2023-11-17 16:31:52,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:31:52,682 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:31:52,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:31:52,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:31:52,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:31:52,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da72191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52, skipping insertion in model container [2023-11-17 16:31:52,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,713 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:31:52,861 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3146,3159] [2023-11-17 16:31:52,869 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:31:52,878 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:31:52,900 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3146,3159] [2023-11-17 16:31:52,903 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:31:52,909 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:31:52,910 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:31:52,916 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:31:52,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52 WrapperNode [2023-11-17 16:31:52,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:31:52,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:31:52,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:31:52,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:31:52,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,955 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 166 [2023-11-17 16:31:52,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:31:52,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:31:52,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:31:52,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:31:52,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:31:52,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:31:52,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:31:52,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:31:52,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (1/1) ... [2023-11-17 16:31:52,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:31:53,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:31:53,025 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 16:31:53,053 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 16:31:53,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:31:53,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:31:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:31:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:31:53,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:31:53,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:31:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:31:53,063 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:31:53,063 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 16:31:53,063 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 16:31:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:31:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 16:31:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 16:31:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:31:53,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:31:53,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:31:53,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:31:53,066 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 16:31:53,197 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:31:53,201 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:31:53,528 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:31:53,605 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:31:53,606 INFO L307 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-17 16:31:53,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:31:53 BoogieIcfgContainer [2023-11-17 16:31:53,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:31:53,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:31:53,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:31:53,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:31:53,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:31:52" (1/3) ... [2023-11-17 16:31:53,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2225d307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:31:53, skipping insertion in model container [2023-11-17 16:31:53,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:31:52" (2/3) ... [2023-11-17 16:31:53,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2225d307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:31:53, skipping insertion in model container [2023-11-17 16:31:53,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:31:53" (3/3) ... [2023-11-17 16:31:53,615 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-11-17 16:31:53,628 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:31:53,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:31:53,628 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:31:53,732 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 16:31:53,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 145 transitions, 311 flow [2023-11-17 16:31:53,839 INFO L124 PetriNetUnfolderBase]: 10/142 cut-off events. [2023-11-17 16:31:53,840 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:31:53,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 10/142 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2023-11-17 16:31:53,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 145 transitions, 311 flow [2023-11-17 16:31:53,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 131 transitions, 280 flow [2023-11-17 16:31:53,861 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:31:53,875 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 131 transitions, 280 flow [2023-11-17 16:31:53,878 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 131 transitions, 280 flow [2023-11-17 16:31:53,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 131 transitions, 280 flow [2023-11-17 16:31:53,905 INFO L124 PetriNetUnfolderBase]: 10/131 cut-off events. [2023-11-17 16:31:53,905 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:31:53,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 10/131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2023-11-17 16:31:53,908 INFO L119 LiptonReduction]: Number of co-enabled transitions 1514 [2023-11-17 16:31:58,488 INFO L134 LiptonReduction]: Checked pairs total: 2215 [2023-11-17 16:31:58,489 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-11-17 16:31:58,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:31:58,508 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;@1c97a2de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:31:58,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 16:31:58,515 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:31:58,515 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2023-11-17 16:31:58,515 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:31:58,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:31:58,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:31:58,516 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:31:58,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:31:58,521 INFO L85 PathProgramCache]: Analyzing trace with hash -20993807, now seen corresponding path program 1 times [2023-11-17 16:31:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:31:58,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930664225] [2023-11-17 16:31:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:31:58,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:31:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:31:58,907 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 16:31:58,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:31:58,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930664225] [2023-11-17 16:31:58,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930664225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:31:58,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:31:58,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:31:58,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321695184] [2023-11-17 16:31:58,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:31:58,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:31:58,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:31:58,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:31:58,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:31:58,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 272 [2023-11-17 16:31:58,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 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 16:31:58,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:31:58,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 272 [2023-11-17 16:31:58,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:31:59,131 INFO L124 PetriNetUnfolderBase]: 214/342 cut-off events. [2023-11-17 16:31:59,131 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-17 16:31:59,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 342 events. 214/342 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1055 event pairs, 15 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 616. Up to 121 conditions per place. [2023-11-17 16:31:59,135 INFO L140 encePairwiseOnDemand]: 267/272 looper letters, 48 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-11-17 16:31:59,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 242 flow [2023-11-17 16:31:59,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:31:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:31:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-11-17 16:31:59,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48161764705882354 [2023-11-17 16:31:59,151 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-11-17 16:31:59,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-11-17 16:31:59,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:31:59,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-11-17 16:31:59,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 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 16:31:59,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 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 16:31:59,167 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 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 16:31:59,169 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 5 states and 655 transitions. [2023-11-17 16:31:59,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 242 flow [2023-11-17 16:31:59,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 53 transitions, 219 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-17 16:31:59,174 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 82 flow [2023-11-17 16:31:59,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-11-17 16:31:59,179 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-11-17 16:31:59,179 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 82 flow [2023-11-17 16:31:59,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 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 16:31:59,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:31:59,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:31:59,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:31:59,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:31:59,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:31:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2103001195, now seen corresponding path program 2 times [2023-11-17 16:31:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:31:59,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914312223] [2023-11-17 16:31:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:31:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:31:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:31:59,336 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 16:31:59,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:31:59,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914312223] [2023-11-17 16:31:59,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914312223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:31:59,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:31:59,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:31:59,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291199336] [2023-11-17 16:31:59,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:31:59,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:31:59,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:31:59,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:31:59,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:31:59,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 272 [2023-11-17 16:31:59,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 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 16:31:59,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:31:59,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 272 [2023-11-17 16:31:59,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:31:59,469 INFO L124 PetriNetUnfolderBase]: 209/341 cut-off events. [2023-11-17 16:31:59,469 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2023-11-17 16:31:59,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 341 events. 209/341 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1084 event pairs, 30 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 452. Up to 167 conditions per place. [2023-11-17 16:31:59,474 INFO L140 encePairwiseOnDemand]: 267/272 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-11-17 16:31:59,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 258 flow [2023-11-17 16:31:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:31:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:31:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-11-17 16:31:59,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772058823529412 [2023-11-17 16:31:59,478 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-11-17 16:31:59,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-11-17 16:31:59,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:31:59,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-11-17 16:31:59,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 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 16:31:59,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 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 16:31:59,486 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 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 16:31:59,486 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 82 flow. Second operand 5 states and 649 transitions. [2023-11-17 16:31:59,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 258 flow [2023-11-17 16:31:59,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:31:59,491 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 123 flow [2023-11-17 16:31:59,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2023-11-17 16:31:59,492 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-11-17 16:31:59,493 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 123 flow [2023-11-17 16:31:59,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 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 16:31:59,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:31:59,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:31:59,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:31:59,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:31:59,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:31:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1914044609, now seen corresponding path program 3 times [2023-11-17 16:31:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:31:59,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881994707] [2023-11-17 16:31:59,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:31:59,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:31:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:31:59,763 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 16:31:59,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:31:59,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881994707] [2023-11-17 16:31:59,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881994707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:31:59,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:31:59,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:31:59,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69977048] [2023-11-17 16:31:59,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:31:59,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 16:31:59,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:31:59,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 16:31:59,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 16:31:59,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 272 [2023-11-17 16:31:59,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 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 16:31:59,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:31:59,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 272 [2023-11-17 16:31:59,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:31:59,949 INFO L124 PetriNetUnfolderBase]: 360/594 cut-off events. [2023-11-17 16:31:59,949 INFO L125 PetriNetUnfolderBase]: For 405/405 co-relation queries the response was YES. [2023-11-17 16:31:59,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 594 events. 360/594 cut-off events. For 405/405 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2267 event pairs, 43 based on Foata normal form. 20/613 useless extension candidates. Maximal degree in co-relation 1154. Up to 182 conditions per place. [2023-11-17 16:31:59,953 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 52 selfloop transitions, 8 changer transitions 24/84 dead transitions. [2023-11-17 16:31:59,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 84 transitions, 475 flow [2023-11-17 16:31:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 16:31:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 16:31:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 907 transitions. [2023-11-17 16:31:59,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47636554621848737 [2023-11-17 16:31:59,956 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 907 transitions. [2023-11-17 16:31:59,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 907 transitions. [2023-11-17 16:31:59,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:31:59,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 907 transitions. [2023-11-17 16:31:59,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.57142857142858) internal successors, (907), 7 states have internal predecessors, (907), 0 states have call successors, (0), 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 16:31:59,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 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 16:31:59,964 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 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 16:31:59,964 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 123 flow. Second operand 7 states and 907 transitions. [2023-11-17 16:31:59,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 84 transitions, 475 flow [2023-11-17 16:31:59,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 84 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:31:59,970 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 152 flow [2023-11-17 16:31:59,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-11-17 16:31:59,972 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-11-17 16:31:59,972 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 152 flow [2023-11-17 16:31:59,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 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 16:31:59,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:31:59,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:31:59,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:31:59,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:31:59,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:31:59,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1405285073, now seen corresponding path program 1 times [2023-11-17 16:31:59,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:31:59,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243497551] [2023-11-17 16:31:59,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:31:59,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:32:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:32:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:32:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243497551] [2023-11-17 16:32:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243497551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:32:00,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:32:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:32:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989565371] [2023-11-17 16:32:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:32:00,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:32:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:32:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:32:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:32:00,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-11-17 16:32:00,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 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 16:32:00,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:32:00,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-11-17 16:32:00,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:32:00,116 INFO L124 PetriNetUnfolderBase]: 103/203 cut-off events. [2023-11-17 16:32:00,117 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2023-11-17 16:32:00,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 203 events. 103/203 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 583 event pairs, 27 based on Foata normal form. 10/208 useless extension candidates. Maximal degree in co-relation 635. Up to 136 conditions per place. [2023-11-17 16:32:00,119 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 26 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-11-17 16:32:00,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 32 transitions, 189 flow [2023-11-17 16:32:00,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:32:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:32:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-11-17 16:32:00,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-11-17 16:32:00,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-11-17 16:32:00,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-11-17 16:32:00,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:32:00,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-11-17 16:32:00,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 16:32:00,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 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 16:32:00,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 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 16:32:00,125 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 152 flow. Second operand 3 states and 400 transitions. [2023-11-17 16:32:00,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 32 transitions, 189 flow [2023-11-17 16:32:00,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 164 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-11-17 16:32:00,128 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 108 flow [2023-11-17 16:32:00,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-11-17 16:32:00,129 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-11-17 16:32:00,129 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 108 flow [2023-11-17 16:32:00,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 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 16:32:00,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:32:00,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:32:00,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 16:32:00,130 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:32:00,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:32:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1167382747, now seen corresponding path program 1 times [2023-11-17 16:32:00,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:32:00,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415682568] [2023-11-17 16:32:00,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:32:00,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:32:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:32:00,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:32:00,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415682568] [2023-11-17 16:32:00,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415682568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:32:00,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:32:00,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:32:00,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151871751] [2023-11-17 16:32:00,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:32:00,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:32:00,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:32:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:32:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:32:00,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 272 [2023-11-17 16:32:00,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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 16:32:00,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:32:00,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 272 [2023-11-17 16:32:00,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:32:00,320 INFO L124 PetriNetUnfolderBase]: 118/238 cut-off events. [2023-11-17 16:32:00,321 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2023-11-17 16:32:00,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 238 events. 118/238 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 701 event pairs, 71 based on Foata normal form. 8/238 useless extension candidates. Maximal degree in co-relation 704. Up to 174 conditions per place. [2023-11-17 16:32:00,322 INFO L140 encePairwiseOnDemand]: 268/272 looper letters, 23 selfloop transitions, 2 changer transitions 9/38 dead transitions. [2023-11-17 16:32:00,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 204 flow [2023-11-17 16:32:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:32:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:32:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-11-17 16:32:00,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420955882352941 [2023-11-17 16:32:00,325 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-11-17 16:32:00,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-11-17 16:32:00,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:32:00,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-11-17 16:32:00,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 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 16:32:00,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 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 16:32:00,328 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 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 16:32:00,329 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 108 flow. Second operand 4 states and 481 transitions. [2023-11-17 16:32:00,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 204 flow [2023-11-17 16:32:00,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:32:00,331 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 120 flow [2023-11-17 16:32:00,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-17 16:32:00,331 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-11-17 16:32:00,331 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 120 flow [2023-11-17 16:32:00,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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 16:32:00,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:32:00,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:32:00,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 16:32:00,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:32:00,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:32:00,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1952388724, now seen corresponding path program 1 times [2023-11-17 16:32:00,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:32:00,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742284891] [2023-11-17 16:32:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:32:00,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:32:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:32:01,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:32:01,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742284891] [2023-11-17 16:32:01,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742284891] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:32:01,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774743443] [2023-11-17 16:32:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:32:01,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:32:01,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:32:01,165 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 16:32:01,201 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 16:32:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:01,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-17 16:32:01,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:32:01,409 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 16:32:01,476 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 16:32:01,594 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 16:32:01,641 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 16:32:01,800 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 16:32:01,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:32:02,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:02,793 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 68 treesize of output 56 [2023-11-17 16:32:02,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:02,812 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 2636 treesize of output 2516 [2023-11-17 16:32:02,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:02,847 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 218 treesize of output 214 [2023-11-17 16:32:02,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:02,869 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 206 treesize of output 190 [2023-11-17 16:32:02,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:02,891 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 205 treesize of output 165 [2023-11-17 16:32:03,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:03,334 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 69 treesize of output 57 [2023-11-17 16:32:03,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:32:03,349 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 1340 treesize of output 1280 [2023-11-17 16:32:03,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:32:03,381 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 194 [2023-11-17 16:32:03,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:32:03,393 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 182 [2023-11-17 16:32:03,412 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:32:03,413 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 205 treesize of output 161 [2023-11-17 16:32:03,545 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 16:32:03,611 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 16:32:03,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774743443] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:32:03,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:32:03,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2023-11-17 16:32:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285778242] [2023-11-17 16:32:03,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:32:03,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 16:32:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:32:03,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 16:32:03,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=729, Unknown=10, NotChecked=0, Total=930 [2023-11-17 16:32:03,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 272 [2023-11-17 16:32:03,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 120 flow. Second operand has 31 states, 31 states have (on average 70.90322580645162) internal successors, (2198), 31 states have internal predecessors, (2198), 0 states have call successors, (0), 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 16:32:03,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:32:03,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 272 [2023-11-17 16:32:03,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:32:13,639 INFO L124 PetriNetUnfolderBase]: 1337/2246 cut-off events. [2023-11-17 16:32:13,639 INFO L125 PetriNetUnfolderBase]: For 2129/2129 co-relation queries the response was YES. [2023-11-17 16:32:13,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7033 conditions, 2246 events. 1337/2246 cut-off events. For 2129/2129 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11176 event pairs, 28 based on Foata normal form. 118/2360 useless extension candidates. Maximal degree in co-relation 7020. Up to 466 conditions per place. [2023-11-17 16:32:13,648 INFO L140 encePairwiseOnDemand]: 255/272 looper letters, 309 selfloop transitions, 230 changer transitions 29/568 dead transitions. [2023-11-17 16:32:13,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 568 transitions, 3288 flow [2023-11-17 16:32:13,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2023-11-17 16:32:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2023-11-17 16:32:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 7949 transitions. [2023-11-17 16:32:13,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2731239692138538 [2023-11-17 16:32:13,675 INFO L72 ComplementDD]: Start complementDD. Operand 107 states and 7949 transitions. [2023-11-17 16:32:13,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 7949 transitions. [2023-11-17 16:32:13,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:32:13,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 107 states and 7949 transitions. [2023-11-17 16:32:13,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 108 states, 107 states have (on average 74.28971962616822) internal successors, (7949), 107 states have internal predecessors, (7949), 0 states have call successors, (0), 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 16:32:13,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 108 states, 108 states have (on average 272.0) internal successors, (29376), 108 states have internal predecessors, (29376), 0 states have call successors, (0), 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 16:32:13,755 INFO L81 ComplementDD]: Finished complementDD. Result has 108 states, 108 states have (on average 272.0) internal successors, (29376), 108 states have internal predecessors, (29376), 0 states have call successors, (0), 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 16:32:13,756 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 120 flow. Second operand 107 states and 7949 transitions. [2023-11-17 16:32:13,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 568 transitions, 3288 flow [2023-11-17 16:32:13,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 568 transitions, 3250 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-11-17 16:32:13,769 INFO L231 Difference]: Finished difference. Result has 163 places, 292 transitions, 1920 flow [2023-11-17 16:32:13,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=107, PETRI_FLOW=1920, PETRI_PLACES=163, PETRI_TRANSITIONS=292} [2023-11-17 16:32:13,772 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 132 predicate places. [2023-11-17 16:32:13,772 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 292 transitions, 1920 flow [2023-11-17 16:32:13,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 70.90322580645162) internal successors, (2198), 31 states have internal predecessors, (2198), 0 states have call successors, (0), 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 16:32:13,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:32:13,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:32:13,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-17 16:32:13,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-17 16:32:13,980 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:32:13,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:32:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash -450643804, now seen corresponding path program 2 times [2023-11-17 16:32:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:32:13,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906437254] [2023-11-17 16:32:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:32:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:32:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:32:14,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:32:14,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906437254] [2023-11-17 16:32:14,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906437254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:32:14,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042734913] [2023-11-17 16:32:14,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:32:14,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:32:14,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:32:14,821 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 16:32:14,843 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 16:32:14,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:32:14,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:32:14,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-17 16:32:14,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:32:15,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:32:15,103 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 20 treesize of output 15 [2023-11-17 16:32:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:32:15,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:32:15,298 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_140 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_140) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_140 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_140) c_~queue~0.base) .cse0)))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-11-17 16:32:15,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:15,319 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 110 treesize of output 86 [2023-11-17 16:32:15,324 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 53 treesize of output 47 [2023-11-17 16:32:15,328 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 47 treesize of output 41 [2023-11-17 16:32:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:32:15,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042734913] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:32:15,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:32:15,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2023-11-17 16:32:15,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629183830] [2023-11-17 16:32:15,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:32:15,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 16:32:15,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:32:15,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 16:32:15,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=613, Unknown=1, NotChecked=50, Total=756 [2023-11-17 16:32:15,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 272 [2023-11-17 16:32:15,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 292 transitions, 1920 flow. Second operand has 28 states, 28 states have (on average 77.10714285714286) internal successors, (2159), 28 states have internal predecessors, (2159), 0 states have call successors, (0), 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 16:32:15,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:32:15,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 272 [2023-11-17 16:32:15,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:32:17,288 INFO L124 PetriNetUnfolderBase]: 1109/1855 cut-off events. [2023-11-17 16:32:17,289 INFO L125 PetriNetUnfolderBase]: For 10015/10015 co-relation queries the response was YES. [2023-11-17 16:32:17,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8966 conditions, 1855 events. 1109/1855 cut-off events. For 10015/10015 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8743 event pairs, 60 based on Foata normal form. 90/1943 useless extension candidates. Maximal degree in co-relation 8936. Up to 597 conditions per place. [2023-11-17 16:32:17,302 INFO L140 encePairwiseOnDemand]: 255/272 looper letters, 208 selfloop transitions, 137 changer transitions 100/445 dead transitions. [2023-11-17 16:32:17,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 445 transitions, 3945 flow [2023-11-17 16:32:17,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-17 16:32:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-11-17 16:32:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2974 transitions. [2023-11-17 16:32:17,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2955087440381558 [2023-11-17 16:32:17,307 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2974 transitions. [2023-11-17 16:32:17,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2974 transitions. [2023-11-17 16:32:17,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:32:17,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2974 transitions. [2023-11-17 16:32:17,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 80.37837837837837) internal successors, (2974), 37 states have internal predecessors, (2974), 0 states have call successors, (0), 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 16:32:17,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 272.0) internal successors, (10336), 38 states have internal predecessors, (10336), 0 states have call successors, (0), 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 16:32:17,324 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 272.0) internal successors, (10336), 38 states have internal predecessors, (10336), 0 states have call successors, (0), 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 16:32:17,324 INFO L175 Difference]: Start difference. First operand has 163 places, 292 transitions, 1920 flow. Second operand 37 states and 2974 transitions. [2023-11-17 16:32:17,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 445 transitions, 3945 flow [2023-11-17 16:32:17,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 445 transitions, 3171 flow, removed 273 selfloop flow, removed 17 redundant places. [2023-11-17 16:32:17,371 INFO L231 Difference]: Finished difference. Result has 179 places, 245 transitions, 1560 flow [2023-11-17 16:32:17,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1560, PETRI_PLACES=179, PETRI_TRANSITIONS=245} [2023-11-17 16:32:17,372 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2023-11-17 16:32:17,373 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 245 transitions, 1560 flow [2023-11-17 16:32:17,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 77.10714285714286) internal successors, (2159), 28 states have internal predecessors, (2159), 0 states have call successors, (0), 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 16:32:17,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:32:17,374 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:32:17,380 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 16:32:17,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-17 16:32:17,580 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:32:17,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:32:17,581 INFO L85 PathProgramCache]: Analyzing trace with hash 612973297, now seen corresponding path program 3 times [2023-11-17 16:32:17,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:32:17,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351348831] [2023-11-17 16:32:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:32:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:32:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:32:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:32:18,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351348831] [2023-11-17 16:32:18,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351348831] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:32:18,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405521029] [2023-11-17 16:32:18,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:32:18,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:32:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:32:18,357 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 16:32:18,368 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 16:32:18,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:32:18,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:32:18,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-17 16:32:18,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:32:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:32:18,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:32:18,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:18,688 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 68 treesize of output 44 [2023-11-17 16:32:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:32:18,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405521029] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:32:18,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:32:18,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 22 [2023-11-17 16:32:18,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840637591] [2023-11-17 16:32:18,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:32:18,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-17 16:32:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:32:18,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-17 16:32:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2023-11-17 16:32:18,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 272 [2023-11-17 16:32:18,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 245 transitions, 1560 flow. Second operand has 23 states, 23 states have (on average 84.47826086956522) internal successors, (1943), 23 states have internal predecessors, (1943), 0 states have call successors, (0), 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 16:32:18,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:32:18,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 272 [2023-11-17 16:32:18,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:32:19,650 INFO L124 PetriNetUnfolderBase]: 1117/1905 cut-off events. [2023-11-17 16:32:19,651 INFO L125 PetriNetUnfolderBase]: For 11844/11844 co-relation queries the response was YES. [2023-11-17 16:32:19,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10266 conditions, 1905 events. 1117/1905 cut-off events. For 11844/11844 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9156 event pairs, 44 based on Foata normal form. 36/1925 useless extension candidates. Maximal degree in co-relation 10242. Up to 654 conditions per place. [2023-11-17 16:32:19,670 INFO L140 encePairwiseOnDemand]: 262/272 looper letters, 218 selfloop transitions, 93 changer transitions 62/373 dead transitions. [2023-11-17 16:32:19,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 373 transitions, 3289 flow [2023-11-17 16:32:19,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 16:32:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-17 16:32:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1416 transitions. [2023-11-17 16:32:19,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32536764705882354 [2023-11-17 16:32:19,673 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1416 transitions. [2023-11-17 16:32:19,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1416 transitions. [2023-11-17 16:32:19,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:32:19,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1416 transitions. [2023-11-17 16:32:19,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 88.5) internal successors, (1416), 16 states have internal predecessors, (1416), 0 states have call successors, (0), 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 16:32:19,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 272.0) internal successors, (4624), 17 states have internal predecessors, (4624), 0 states have call successors, (0), 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 16:32:19,687 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 272.0) internal successors, (4624), 17 states have internal predecessors, (4624), 0 states have call successors, (0), 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 16:32:19,687 INFO L175 Difference]: Start difference. First operand has 179 places, 245 transitions, 1560 flow. Second operand 16 states and 1416 transitions. [2023-11-17 16:32:19,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 373 transitions, 3289 flow [2023-11-17 16:32:19,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 373 transitions, 2976 flow, removed 59 selfloop flow, removed 19 redundant places. [2023-11-17 16:32:19,716 INFO L231 Difference]: Finished difference. Result has 159 places, 252 transitions, 1689 flow [2023-11-17 16:32:19,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1689, PETRI_PLACES=159, PETRI_TRANSITIONS=252} [2023-11-17 16:32:19,720 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2023-11-17 16:32:19,720 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 252 transitions, 1689 flow [2023-11-17 16:32:19,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 84.47826086956522) internal successors, (1943), 23 states have internal predecessors, (1943), 0 states have call successors, (0), 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 16:32:19,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:32:19,721 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:32:19,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-17 16:32:19,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:32:19,928 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:32:19,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:32:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash -127244763, now seen corresponding path program 4 times [2023-11-17 16:32:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:32:19,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738366017] [2023-11-17 16:32:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:32:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:32:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:32:20,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:32:20,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738366017] [2023-11-17 16:32:20,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738366017] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:32:20,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022732638] [2023-11-17 16:32:20,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:32:20,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:32:20,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:32:20,851 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 16:32:20,868 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 16:32:20,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:32:20,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:32:20,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-17 16:32:20,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:32:21,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:32:21,116 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 20 treesize of output 15 [2023-11-17 16:32:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:32:21,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:32:21,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:21,330 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 110 treesize of output 86 [2023-11-17 16:32:21,335 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 53 treesize of output 47 [2023-11-17 16:32:21,344 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 47 treesize of output 41 [2023-11-17 16:32:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:32:21,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022732638] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:32:21,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:32:21,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2023-11-17 16:32:21,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219119299] [2023-11-17 16:32:21,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:32:21,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 16:32:21,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:32:21,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 16:32:21,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=656, Unknown=9, NotChecked=0, Total=756 [2023-11-17 16:32:21,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 272 [2023-11-17 16:32:21,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 252 transitions, 1689 flow. Second operand has 28 states, 28 states have (on average 77.32142857142857) internal successors, (2165), 28 states have internal predecessors, (2165), 0 states have call successors, (0), 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 16:32:21,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:32:21,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 272 [2023-11-17 16:32:21,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:32:22,882 INFO L124 PetriNetUnfolderBase]: 1171/1953 cut-off events. [2023-11-17 16:32:22,883 INFO L125 PetriNetUnfolderBase]: For 12582/12582 co-relation queries the response was YES. [2023-11-17 16:32:22,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10985 conditions, 1953 events. 1171/1953 cut-off events. For 12582/12582 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9338 event pairs, 44 based on Foata normal form. 28/1977 useless extension candidates. Maximal degree in co-relation 10959. Up to 661 conditions per place. [2023-11-17 16:32:22,901 INFO L140 encePairwiseOnDemand]: 260/272 looper letters, 213 selfloop transitions, 137 changer transitions 30/380 dead transitions. [2023-11-17 16:32:22,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 380 transitions, 3587 flow [2023-11-17 16:32:22,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-17 16:32:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-17 16:32:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2173 transitions. [2023-11-17 16:32:22,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29588779956427014 [2023-11-17 16:32:22,905 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2173 transitions. [2023-11-17 16:32:22,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2173 transitions. [2023-11-17 16:32:22,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:32:22,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2173 transitions. [2023-11-17 16:32:22,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 80.48148148148148) internal successors, (2173), 27 states have internal predecessors, (2173), 0 states have call successors, (0), 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 16:32:22,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 272.0) internal successors, (7616), 28 states have internal predecessors, (7616), 0 states have call successors, (0), 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 16:32:22,920 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 272.0) internal successors, (7616), 28 states have internal predecessors, (7616), 0 states have call successors, (0), 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 16:32:22,921 INFO L175 Difference]: Start difference. First operand has 159 places, 252 transitions, 1689 flow. Second operand 27 states and 2173 transitions. [2023-11-17 16:32:22,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 380 transitions, 3587 flow [2023-11-17 16:32:22,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 380 transitions, 3501 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-17 16:32:22,955 INFO L231 Difference]: Finished difference. Result has 182 places, 268 transitions, 2121 flow [2023-11-17 16:32:22,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2121, PETRI_PLACES=182, PETRI_TRANSITIONS=268} [2023-11-17 16:32:22,958 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 151 predicate places. [2023-11-17 16:32:22,958 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 268 transitions, 2121 flow [2023-11-17 16:32:22,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 77.32142857142857) internal successors, (2165), 28 states have internal predecessors, (2165), 0 states have call successors, (0), 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 16:32:22,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:32:22,959 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:32:22,965 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 16:32:23,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:32:23,165 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:32:23,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:32:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1255658574, now seen corresponding path program 5 times [2023-11-17 16:32:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:32:23,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015054188] [2023-11-17 16:32:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:32:23,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:32:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:32:23,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:32:23,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015054188] [2023-11-17 16:32:23,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015054188] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:32:23,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827062066] [2023-11-17 16:32:23,264 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:32:23,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:32:23,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:32:23,266 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 16:32:23,278 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 16:32:23,366 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-17 16:32:23,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:32:23,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:32:23,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:32:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:32:23,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:32:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:32:23,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827062066] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:32:23,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:32:23,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-17 16:32:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610716402] [2023-11-17 16:32:23,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:32:23,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 16:32:23,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:32:23,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 16:32:23,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:32:23,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 272 [2023-11-17 16:32:23,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 268 transitions, 2121 flow. Second operand has 12 states, 12 states have (on average 111.25) internal successors, (1335), 12 states have internal predecessors, (1335), 0 states have call successors, (0), 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 16:32:23,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:32:23,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 272 [2023-11-17 16:32:23,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:32:23,813 INFO L124 PetriNetUnfolderBase]: 687/1273 cut-off events. [2023-11-17 16:32:23,813 INFO L125 PetriNetUnfolderBase]: For 8645/8859 co-relation queries the response was YES. [2023-11-17 16:32:23,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7254 conditions, 1273 events. 687/1273 cut-off events. For 8645/8859 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6474 event pairs, 107 based on Foata normal form. 103/1326 useless extension candidates. Maximal degree in co-relation 7226. Up to 630 conditions per place. [2023-11-17 16:32:23,823 INFO L140 encePairwiseOnDemand]: 267/272 looper letters, 125 selfloop transitions, 20 changer transitions 65/229 dead transitions. [2023-11-17 16:32:23,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 229 transitions, 2299 flow [2023-11-17 16:32:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 16:32:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 16:32:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 914 transitions. [2023-11-17 16:32:23,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42003676470588236 [2023-11-17 16:32:23,826 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 914 transitions. [2023-11-17 16:32:23,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 914 transitions. [2023-11-17 16:32:23,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:32:23,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 914 transitions. [2023-11-17 16:32:23,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 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 16:32:23,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 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 16:32:23,832 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 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 16:32:23,832 INFO L175 Difference]: Start difference. First operand has 182 places, 268 transitions, 2121 flow. Second operand 8 states and 914 transitions. [2023-11-17 16:32:23,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 229 transitions, 2299 flow [2023-11-17 16:32:23,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 229 transitions, 2091 flow, removed 10 selfloop flow, removed 21 redundant places. [2023-11-17 16:32:23,857 INFO L231 Difference]: Finished difference. Result has 158 places, 162 transitions, 1232 flow [2023-11-17 16:32:23,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1232, PETRI_PLACES=158, PETRI_TRANSITIONS=162} [2023-11-17 16:32:23,859 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2023-11-17 16:32:23,859 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 162 transitions, 1232 flow [2023-11-17 16:32:23,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 111.25) internal successors, (1335), 12 states have internal predecessors, (1335), 0 states have call successors, (0), 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 16:32:23,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:32:23,859 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:32:23,866 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 16:32:24,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-17 16:32:24,066 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:32:24,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:32:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash 554194423, now seen corresponding path program 6 times [2023-11-17 16:32:24,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:32:24,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669056495] [2023-11-17 16:32:24,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:32:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:32:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:32:24,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:32:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669056495] [2023-11-17 16:32:24,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669056495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:32:24,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:32:24,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:32:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641806372] [2023-11-17 16:32:24,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:32:24,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:32:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:32:24,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:32:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:32:24,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-11-17 16:32:24,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 162 transitions, 1232 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 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 16:32:24,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:32:24,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-11-17 16:32:24,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:32:24,398 INFO L124 PetriNetUnfolderBase]: 913/1675 cut-off events. [2023-11-17 16:32:24,399 INFO L125 PetriNetUnfolderBase]: For 10259/10456 co-relation queries the response was YES. [2023-11-17 16:32:24,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9064 conditions, 1675 events. 913/1675 cut-off events. For 10259/10456 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8590 event pairs, 128 based on Foata normal form. 43/1652 useless extension candidates. Maximal degree in co-relation 9036. Up to 593 conditions per place. [2023-11-17 16:32:24,454 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 161 selfloop transitions, 61 changer transitions 0/241 dead transitions. [2023-11-17 16:32:24,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 241 transitions, 2257 flow [2023-11-17 16:32:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:32:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:32:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-11-17 16:32:24,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036764705882353 [2023-11-17 16:32:24,459 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-11-17 16:32:24,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-11-17 16:32:24,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:32:24,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-11-17 16:32:24,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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 16:32:24,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 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 16:32:24,461 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 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 16:32:24,461 INFO L175 Difference]: Start difference. First operand has 158 places, 162 transitions, 1232 flow. Second operand 4 states and 548 transitions. [2023-11-17 16:32:24,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 241 transitions, 2257 flow [2023-11-17 16:32:24,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 241 transitions, 2171 flow, removed 23 selfloop flow, removed 7 redundant places. [2023-11-17 16:32:24,480 INFO L231 Difference]: Finished difference. Result has 130 places, 201 transitions, 1803 flow [2023-11-17 16:32:24,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1803, PETRI_PLACES=130, PETRI_TRANSITIONS=201} [2023-11-17 16:32:24,480 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 99 predicate places. [2023-11-17 16:32:24,480 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 201 transitions, 1803 flow [2023-11-17 16:32:24,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 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 16:32:24,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:32:24,481 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:32:24,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 16:32:24,481 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:32:24,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:32:24,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1277108927, now seen corresponding path program 7 times [2023-11-17 16:32:24,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:32:24,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448404992] [2023-11-17 16:32:24,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:32:24,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:32:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:32:25,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:32:25,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448404992] [2023-11-17 16:32:25,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448404992] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:32:25,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571664972] [2023-11-17 16:32:25,524 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:32:25,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:32:25,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:32:25,525 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 16:32:25,533 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 16:32:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:25,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-17 16:32:25,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:32:25,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:32:25,907 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 20 treesize of output 15 [2023-11-17 16:32:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:32:26,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:32:26,665 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2023-11-17 16:32:26,666 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 441 treesize of output 353 [2023-11-17 16:32:26,708 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-11-17 16:32:26,709 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 260 treesize of output 252 [2023-11-17 16:32:26,730 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-11-17 16:32:26,730 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 241 treesize of output 233 [2023-11-17 16:32:26,757 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-11-17 16:32:26,757 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 222 treesize of output 214 [2023-11-17 16:32:26,780 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-11-17 16:32:26,780 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 203 treesize of output 195 [2023-11-17 16:32:27,922 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 16:32:27,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571664972] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:32:27,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:32:27,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 40 [2023-11-17 16:32:27,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057497312] [2023-11-17 16:32:27,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:32:27,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-17 16:32:27,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:32:27,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-17 16:32:27,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1410, Unknown=1, NotChecked=0, Total=1640 [2023-11-17 16:32:27,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 272 [2023-11-17 16:32:27,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 201 transitions, 1803 flow. Second operand has 41 states, 41 states have (on average 76.78048780487805) internal successors, (3148), 41 states have internal predecessors, (3148), 0 states have call successors, (0), 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 16:32:27,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:32:27,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 272 [2023-11-17 16:32:27,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:32:49,586 INFO L124 PetriNetUnfolderBase]: 7030/11800 cut-off events. [2023-11-17 16:32:49,586 INFO L125 PetriNetUnfolderBase]: For 59902/59902 co-relation queries the response was YES. [2023-11-17 16:32:49,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63180 conditions, 11800 events. 7030/11800 cut-off events. For 59902/59902 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 77362 event pairs, 231 based on Foata normal form. 432/12232 useless extension candidates. Maximal degree in co-relation 63153. Up to 4188 conditions per place. [2023-11-17 16:32:49,655 INFO L140 encePairwiseOnDemand]: 259/272 looper letters, 820 selfloop transitions, 821 changer transitions 348/1989 dead transitions. [2023-11-17 16:32:49,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1989 transitions, 20406 flow [2023-11-17 16:32:49,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2023-11-17 16:32:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2023-11-17 16:32:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 17366 transitions. [2023-11-17 16:32:49,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2969562243502052 [2023-11-17 16:32:49,677 INFO L72 ComplementDD]: Start complementDD. Operand 215 states and 17366 transitions. [2023-11-17 16:32:49,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 17366 transitions. [2023-11-17 16:32:49,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:32:49,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 215 states and 17366 transitions. [2023-11-17 16:32:49,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 216 states, 215 states have (on average 80.77209302325582) internal successors, (17366), 215 states have internal predecessors, (17366), 0 states have call successors, (0), 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 16:32:49,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 216 states, 216 states have (on average 272.0) internal successors, (58752), 216 states have internal predecessors, (58752), 0 states have call successors, (0), 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 16:32:49,765 INFO L81 ComplementDD]: Finished complementDD. Result has 216 states, 216 states have (on average 272.0) internal successors, (58752), 216 states have internal predecessors, (58752), 0 states have call successors, (0), 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 16:32:49,766 INFO L175 Difference]: Start difference. First operand has 130 places, 201 transitions, 1803 flow. Second operand 215 states and 17366 transitions. [2023-11-17 16:32:49,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 1989 transitions, 20406 flow [2023-11-17 16:32:49,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 1989 transitions, 20348 flow, removed 29 selfloop flow, removed 0 redundant places. [2023-11-17 16:32:49,862 INFO L231 Difference]: Finished difference. Result has 385 places, 943 transitions, 10720 flow [2023-11-17 16:32:49,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=215, PETRI_FLOW=10720, PETRI_PLACES=385, PETRI_TRANSITIONS=943} [2023-11-17 16:32:49,864 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 354 predicate places. [2023-11-17 16:32:49,864 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 943 transitions, 10720 flow [2023-11-17 16:32:49,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 76.78048780487805) internal successors, (3148), 41 states have internal predecessors, (3148), 0 states have call successors, (0), 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 16:32:49,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:32:49,865 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:32:49,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-17 16:32:50,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:32:50,071 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:32:50,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:32:50,071 INFO L85 PathProgramCache]: Analyzing trace with hash 423408645, now seen corresponding path program 8 times [2023-11-17 16:32:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:32:50,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380389623] [2023-11-17 16:32:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:32:50,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:32:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:32:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:32:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:32:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380389623] [2023-11-17 16:32:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380389623] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:32:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735671843] [2023-11-17 16:32:51,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:32:51,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:32:51,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:32:51,244 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 16:32:51,245 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 16:32:51,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:32:51,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:32:51,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-17 16:32:51,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:32:51,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:32:51,525 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 21 treesize of output 16 [2023-11-17 16:32:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:32:51,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:32:52,162 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-17 16:32:52,163 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 448 treesize of output 368 [2023-11-17 16:32:52,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:52,191 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 267 treesize of output 267 [2023-11-17 16:32:52,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:52,219 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 248 treesize of output 248 [2023-11-17 16:32:52,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:52,246 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 229 treesize of output 229 [2023-11-17 16:32:52,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:32:52,268 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 210 treesize of output 210 [2023-11-17 16:32:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:32:53,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735671843] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:32:53,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:32:53,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 35 [2023-11-17 16:32:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334730265] [2023-11-17 16:32:53,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:32:53,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-17 16:32:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:32:53,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-17 16:32:53,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1099, Unknown=9, NotChecked=0, Total=1260 [2023-11-17 16:32:53,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 272 [2023-11-17 16:32:53,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 943 transitions, 10720 flow. Second operand has 36 states, 36 states have (on average 78.97222222222223) internal successors, (2843), 36 states have internal predecessors, (2843), 0 states have call successors, (0), 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 16:32:53,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:32:53,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 272 [2023-11-17 16:32:53,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:32:59,493 INFO L124 PetriNetUnfolderBase]: 9686/16474 cut-off events. [2023-11-17 16:32:59,494 INFO L125 PetriNetUnfolderBase]: For 253791/253791 co-relation queries the response was YES. [2023-11-17 16:32:59,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111452 conditions, 16474 events. 9686/16474 cut-off events. For 253791/253791 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 116217 event pairs, 784 based on Foata normal form. 284/16758 useless extension candidates. Maximal degree in co-relation 111383. Up to 5877 conditions per place. [2023-11-17 16:32:59,655 INFO L140 encePairwiseOnDemand]: 262/272 looper letters, 850 selfloop transitions, 740 changer transitions 563/2153 dead transitions. [2023-11-17 16:32:59,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 2153 transitions, 27504 flow [2023-11-17 16:32:59,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-17 16:32:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-11-17 16:32:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 4031 transitions. [2023-11-17 16:32:59,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30874693627450983 [2023-11-17 16:32:59,661 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 4031 transitions. [2023-11-17 16:32:59,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 4031 transitions. [2023-11-17 16:32:59,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:32:59,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 4031 transitions. [2023-11-17 16:32:59,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 83.97916666666667) internal successors, (4031), 48 states have internal predecessors, (4031), 0 states have call successors, (0), 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 16:32:59,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 272.0) internal successors, (13328), 49 states have internal predecessors, (13328), 0 states have call successors, (0), 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 16:32:59,678 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 272.0) internal successors, (13328), 49 states have internal predecessors, (13328), 0 states have call successors, (0), 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 16:32:59,678 INFO L175 Difference]: Start difference. First operand has 385 places, 943 transitions, 10720 flow. Second operand 48 states and 4031 transitions. [2023-11-17 16:32:59,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 2153 transitions, 27504 flow [2023-11-17 16:33:01,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 2153 transitions, 24987 flow, removed 1009 selfloop flow, removed 23 redundant places. [2023-11-17 16:33:01,277 INFO L231 Difference]: Finished difference. Result has 429 places, 1227 transitions, 15275 flow [2023-11-17 16:33:01,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=9392, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=469, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=15275, PETRI_PLACES=429, PETRI_TRANSITIONS=1227} [2023-11-17 16:33:01,278 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 398 predicate places. [2023-11-17 16:33:01,278 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 1227 transitions, 15275 flow [2023-11-17 16:33:01,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 78.97222222222223) internal successors, (2843), 36 states have internal predecessors, (2843), 0 states have call successors, (0), 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 16:33:01,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:33:01,279 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:33:01,284 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 16:33:01,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:01,480 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:33:01,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:33:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1870602173, now seen corresponding path program 9 times [2023-11-17 16:33:01,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:33:01,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547583469] [2023-11-17 16:33:01,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:33:01,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:33:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:33:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:33:02,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:33:02,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547583469] [2023-11-17 16:33:02,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547583469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:33:02,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195915194] [2023-11-17 16:33:02,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:33:02,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:33:02,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:33:02,527 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 16:33:02,546 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 16:33:02,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-17 16:33:02,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:33:02,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-17 16:33:02,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:33:03,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:33:03,304 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 16:33:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:33:03,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:33:04,426 INFO L349 Elim1Store]: treesize reduction 16, result has 90.5 percent of original size [2023-11-17 16:33:04,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 379 treesize of output 403 [2023-11-17 16:33:04,443 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 190 treesize of output 184 [2023-11-17 16:33:04,492 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 184 treesize of output 178 [2023-11-17 16:33:04,508 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 178 treesize of output 172 [2023-11-17 16:33:04,534 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 172 treesize of output 166 [2023-11-17 16:33:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:33:46,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195915194] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:33:46,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:33:46,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2023-11-17 16:33:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182962097] [2023-11-17 16:33:46,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:33:46,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-17 16:33:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:33:46,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-17 16:33:46,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1178, Unknown=3, NotChecked=0, Total=1406 [2023-11-17 16:33:46,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 272 [2023-11-17 16:33:46,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 1227 transitions, 15275 flow. Second operand has 38 states, 38 states have (on average 76.86842105263158) internal successors, (2921), 38 states have internal predecessors, (2921), 0 states have call successors, (0), 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 16:33:46,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:33:46,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 272 [2023-11-17 16:33:46,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:33:52,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:33:52,145 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~v_assert~0 1) (let ((.cse0 (+ c_~front~0 1))) (or (< c_~n~0 .cse0) (< c_~back~0 .cse0) (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_374 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse1)))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< c_~front~0 0))) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= |c_thread2Thread1of1ForFork0_~cond~1#1| 1)) is different from false [2023-11-17 16:33:55,325 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse11 (+ c_~front~0 1))) (let ((.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (< c_~n~0 .cse11)) (.cse8 (< c_~back~0 .cse11)) (.cse1 (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse10)) 1)) (forall ((v_ArrVal_374 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse10)))))) (.cse6 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse7 (< c_~front~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or .cse0 .cse1 (let ((.cse2 (< c_~back~0 c_~front~0)) (.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse4 (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse2 (not .cse3) (not (= (+ .cse4 1) 0))) (or .cse2 .cse3 (not (= .cse4 1))))) .cse6 .cse7) (or .cse0 .cse8 (let ((.cse9 (+ c_~sum~0 (select .cse5 .cse10)))) (and (<= .cse9 1) (<= 0 .cse9))) .cse6 .cse7) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or .cse0 .cse8 .cse1 .cse6 .cse7)))) is different from false [2023-11-17 16:33:55,863 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~front~0 1))) (let ((.cse0 (< c_~n~0 .cse6)) (.cse1 (< c_~back~0 .cse6)) (.cse3 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse4 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse5 (< c_~front~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or .cse0 .cse1 (let ((.cse2 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse3)))) (and (<= .cse2 1) (<= 0 .cse2))) .cse4 .cse5) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or .cse0 .cse1 (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_374 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse3))))) .cse4 .cse5)))) is different from false [2023-11-17 16:33:55,872 WARN L854 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (let ((.cse0 (+ c_~front~0 1))) (or (< c_~n~0 .cse0) (< c_~back~0 .cse0) (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_374 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse1)))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< c_~front~0 0)))) is different from false [2023-11-17 16:33:55,889 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse9 (+ c_~front~0 1)) (.cse7 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse2 (let ((.cse10 (< c_~back~0 c_~front~0)) (.cse11 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse12 (select .cse7 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse10 (not .cse11) (not (= (+ .cse12 1) 0))) (or .cse10 .cse11 (not (= .cse12 1)))))) (.cse0 (< c_~n~0 .cse9)) (.cse5 (< c_~back~0 .cse9)) (.cse1 (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse8)) 1)) (forall ((v_ArrVal_374 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse8)))))) (.cse4 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse3 (< c_~front~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or .cse0 (= (mod c_~v_assert~0 256) 0) .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 .cse4 .cse3) (or .cse0 .cse5 (let ((.cse6 (+ c_~sum~0 (select .cse7 .cse8)))) (and (<= .cse6 1) (<= 0 .cse6))) .cse4 .cse3) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or .cse0 .cse5 .cse1 .cse4 .cse3)))) is different from false [2023-11-17 16:33:55,982 WARN L854 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or (< c_~n~0 (+ c_~front~0 1)) (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_374 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse0)))))) (let ((.cse1 (< c_~back~0 c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1))))) (< c_~front~0 0)) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0)) is different from false [2023-11-17 16:34:04,760 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse11 (+ c_~front~0 1))) (let ((.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (< c_~n~0 .cse11)) (.cse8 (< c_~back~0 .cse11)) (.cse1 (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse10)) 1)) (forall ((v_ArrVal_374 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse10)))))) (.cse6 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse7 (< c_~front~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or .cse0 .cse1 (let ((.cse2 (< c_~back~0 c_~front~0)) (.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse4 (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse2 (not .cse3) (not (= (+ .cse4 1) 0))) (or .cse2 .cse3 (not (= .cse4 1))))) .cse6 .cse7) (or .cse0 .cse8 (let ((.cse9 (+ c_~sum~0 (select .cse5 .cse10)))) (and (<= .cse9 1) (<= 0 .cse9))) .cse6 .cse7) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or .cse0 .cse8 .cse1 .cse6 .cse7) (<= 0 c_~sum~0) (<= c_~sum~0 1)))) is different from false [2023-11-17 16:34:05,085 WARN L854 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or (< c_~n~0 (+ c_~front~0 1)) (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_374 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_374 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_374) c_~queue~0.base) .cse0)))))) (let ((.cse1 (< c_~back~0 c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1))))) (< c_~front~0 0)) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-11-17 16:34:09,146 INFO L124 PetriNetUnfolderBase]: 19839/33814 cut-off events. [2023-11-17 16:34:09,147 INFO L125 PetriNetUnfolderBase]: For 270727/270727 co-relation queries the response was YES. [2023-11-17 16:34:09,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219125 conditions, 33814 events. 19839/33814 cut-off events. For 270727/270727 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 266463 event pairs, 1399 based on Foata normal form. 1340/35142 useless extension candidates. Maximal degree in co-relation 219050. Up to 11290 conditions per place. [2023-11-17 16:34:09,641 INFO L140 encePairwiseOnDemand]: 255/272 looper letters, 1454 selfloop transitions, 1793 changer transitions 1924/5171 dead transitions. [2023-11-17 16:34:09,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 5171 transitions, 67630 flow [2023-11-17 16:34:09,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2023-11-17 16:34:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2023-11-17 16:34:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 10537 transitions. [2023-11-17 16:34:09,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30264820772058826 [2023-11-17 16:34:09,654 INFO L72 ComplementDD]: Start complementDD. Operand 128 states and 10537 transitions. [2023-11-17 16:34:09,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 10537 transitions. [2023-11-17 16:34:09,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:34:09,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 128 states and 10537 transitions. [2023-11-17 16:34:09,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 129 states, 128 states have (on average 82.3203125) internal successors, (10537), 128 states have internal predecessors, (10537), 0 states have call successors, (0), 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 16:34:09,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 129 states, 129 states have (on average 272.0) internal successors, (35088), 129 states have internal predecessors, (35088), 0 states have call successors, (0), 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 16:34:09,704 INFO L81 ComplementDD]: Finished complementDD. Result has 129 states, 129 states have (on average 272.0) internal successors, (35088), 129 states have internal predecessors, (35088), 0 states have call successors, (0), 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 16:34:09,704 INFO L175 Difference]: Start difference. First operand has 429 places, 1227 transitions, 15275 flow. Second operand 128 states and 10537 transitions. [2023-11-17 16:34:09,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 5171 transitions, 67630 flow [2023-11-17 16:34:11,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 5171 transitions, 65825 flow, removed 833 selfloop flow, removed 14 redundant places. [2023-11-17 16:34:11,467 INFO L231 Difference]: Finished difference. Result has 635 places, 2499 transitions, 36822 flow [2023-11-17 16:34:11,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=14117, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=604, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=128, PETRI_FLOW=36822, PETRI_PLACES=635, PETRI_TRANSITIONS=2499} [2023-11-17 16:34:11,469 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 604 predicate places. [2023-11-17 16:34:11,469 INFO L495 AbstractCegarLoop]: Abstraction has has 635 places, 2499 transitions, 36822 flow [2023-11-17 16:34:11,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 76.86842105263158) internal successors, (2921), 38 states have internal predecessors, (2921), 0 states have call successors, (0), 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 16:34:11,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:34:11,470 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:34:11,481 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 16:34:11,675 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,SelfDestructingSolverStorable13 [2023-11-17 16:34:11,676 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:34:11,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:34:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash 165226213, now seen corresponding path program 10 times [2023-11-17 16:34:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:34:11,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575631578] [2023-11-17 16:34:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:34:11,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:34:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:34:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:34:12,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:34:12,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575631578] [2023-11-17 16:34:12,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575631578] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:34:12,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6061852] [2023-11-17 16:34:12,738 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:34:12,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:34:12,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:34:12,739 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 16:34:12,742 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 16:34:12,871 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:34:12,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:34:12,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-17 16:34:12,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:34:13,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:34:13,364 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 16:34:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:34:13,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:34:13,791 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~front~0 1)) (.cse5 (select |c_#memory_int| c_~queue~0.base))) (or (< c_~n~0 .cse0) (= .cse0 c_~n~0) (let ((.cse1 (< c_~back~0 c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (= c_~back~0 c_~front~0)) (.cse4 (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) .cse3 (not (= (+ .cse4 1) 0))) (or .cse1 .cse2 .cse3 (not (= .cse4 1))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< c_~front~0 0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (select .cse5 (+ c_~queue~0.offset .cse8))) (.cse7 (+ c_~queue~0.offset .cse8 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse7)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse7)) 1))))))) is different from false [2023-11-17 16:34:13,971 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2023-11-17 16:34:13,972 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 238 treesize of output 184 [2023-11-17 16:34:13,980 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 59 treesize of output 52 [2023-11-17 16:34:13,990 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 52 treesize of output 45 [2023-11-17 16:34:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-17 16:34:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6061852] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:34:14,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:34:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2023-11-17 16:34:14,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752039696] [2023-11-17 16:34:14,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:34:14,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-17 16:34:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:34:14,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-17 16:34:14,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1110, Unknown=2, NotChecked=70, Total=1406 [2023-11-17 16:34:14,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 272 [2023-11-17 16:34:14,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 2499 transitions, 36822 flow. Second operand has 38 states, 38 states have (on average 76.89473684210526) internal successors, (2922), 38 states have internal predecessors, (2922), 0 states have call successors, (0), 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 16:34:14,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:34:14,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 272 [2023-11-17 16:34:14,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:34:15,607 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~front~0 1))) (let ((.cse0 (< c_~n~0 .cse10)) (.cse1 (= .cse10 c_~n~0)) (.cse7 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse8 (< c_~front~0 0)) (.cse9 (let ((.cse13 (* c_~front~0 4))) (let ((.cse11 (select .cse6 (+ c_~queue~0.offset .cse13))) (.cse12 (+ c_~queue~0.offset .cse13 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)) 1))))))) (and (= c_~v_assert~0 1) (= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (or .cse0 .cse1 (let ((.cse2 (< c_~back~0 c_~front~0)) (.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse4 (= c_~back~0 c_~front~0)) (.cse5 (select .cse6 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse2 (not .cse3) .cse4 (not (= (+ .cse5 1) 0))) (or .cse2 .cse3 .cse4 (not (= .cse5 1))))) .cse7 .cse8 .cse9) (or .cse0 (< c_~back~0 .cse10) (= .cse10 c_~back~0) .cse1 .cse7 .cse8 .cse9) (= c_~sum~0 0)))) is different from false [2023-11-17 16:34:15,773 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (let ((.cse0 (+ c_~front~0 1)) (.cse5 (select |c_#memory_int| c_~queue~0.base))) (or (< c_~n~0 .cse0) (= .cse0 c_~n~0) (let ((.cse1 (< c_~back~0 c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (= c_~back~0 c_~front~0)) (.cse4 (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) .cse3 (not (= (+ .cse4 1) 0))) (or .cse1 .cse2 .cse3 (not (= .cse4 1))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< c_~front~0 0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (select .cse5 (+ c_~queue~0.offset .cse8))) (.cse7 (+ c_~queue~0.offset .cse8 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse7)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse7)) 1)))))))) is different from false [2023-11-17 16:34:17,362 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~v_assert~0 1) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (let ((.cse0 (+ c_~front~0 1))) (or (< c_~n~0 .cse0) (< c_~back~0 .cse0) (= .cse0 c_~back~0) (= .cse0 c_~n~0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< c_~front~0 0) (let ((.cse3 (* c_~front~0 4))) (let ((.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3))) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse2)) 1)))))))) is different from false [2023-11-17 16:34:17,560 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~v_assert~0 1) (let ((.cse0 (+ c_~front~0 1))) (or (< c_~n~0 .cse0) (< c_~back~0 .cse0) (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse1)) 1)))) (< c_~front~0 0))) (= |c_thread2Thread1of1ForFork0_~cond~1#1| 1)) is different from false [2023-11-17 16:34:17,575 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~front~0 1))) (let ((.cse0 (< c_~n~0 .cse10)) (.cse1 (= .cse10 c_~n~0)) (.cse7 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse8 (< c_~front~0 0)) (.cse9 (let ((.cse13 (* c_~front~0 4))) (let ((.cse11 (select .cse6 (+ c_~queue~0.offset .cse13))) (.cse12 (+ c_~queue~0.offset .cse13 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)) 1))))))) (and (= c_~v_assert~0 1) (= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (or .cse0 .cse1 (let ((.cse2 (< c_~back~0 c_~front~0)) (.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse4 (= c_~back~0 c_~front~0)) (.cse5 (select .cse6 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse2 (not .cse3) .cse4 (not (= (+ .cse5 1) 0))) (or .cse2 .cse3 .cse4 (not (= .cse5 1))))) .cse7 .cse8 .cse9) (or .cse0 (< c_~back~0 .cse10) (= .cse10 c_~back~0) .cse1 .cse7 .cse8 .cse9)))) is different from false [2023-11-17 16:34:18,061 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~v_assert~0 1) (let ((.cse0 (+ c_~front~0 1))) (or (< c_~n~0 .cse0) (< c_~back~0 .cse0) (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse1)) 1)))) (< c_~front~0 0)))) is different from false [2023-11-17 16:34:20,672 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~v_assert~0 1) (= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (let ((.cse0 (+ c_~front~0 1))) (or (< c_~n~0 .cse0) (< c_~back~0 .cse0) (= .cse0 c_~back~0) (= .cse0 c_~n~0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< c_~front~0 0) (let ((.cse3 (* c_~front~0 4))) (let ((.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3))) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse2)) 1))))))) (= c_~sum~0 0)) is different from false [2023-11-17 16:34:26,626 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~front~0 1))) (let ((.cse0 (< c_~n~0 .cse10)) (.cse1 (= .cse10 c_~n~0)) (.cse7 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse8 (< c_~front~0 0)) (.cse9 (let ((.cse13 (* c_~front~0 4))) (let ((.cse11 (select .cse6 (+ c_~queue~0.offset .cse13))) (.cse12 (+ c_~queue~0.offset .cse13 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)) 1))))))) (and (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (or .cse0 .cse1 (let ((.cse2 (< c_~back~0 c_~front~0)) (.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse4 (= c_~back~0 c_~front~0)) (.cse5 (select .cse6 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse2 (not .cse3) .cse4 (not (= (+ .cse5 1) 0))) (or .cse2 .cse3 .cse4 (not (= .cse5 1))))) .cse7 .cse8 .cse9) (or .cse0 (< c_~back~0 .cse10) (= .cse10 c_~back~0) .cse1 .cse7 .cse8 .cse9)))) is different from false [2023-11-17 16:34:28,225 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~front~0 1))) (let ((.cse0 (< c_~n~0 .cse10)) (.cse1 (= .cse10 c_~n~0)) (.cse7 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse8 (< c_~front~0 0)) (.cse9 (let ((.cse13 (* c_~front~0 4))) (let ((.cse11 (select .cse6 (+ c_~queue~0.offset .cse13))) (.cse12 (+ c_~queue~0.offset .cse13 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)) 1))))))) (and (= c_~v_assert~0 1) (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or .cse0 .cse1 (let ((.cse2 (< c_~back~0 c_~front~0)) (.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse4 (= c_~back~0 c_~front~0)) (.cse5 (select .cse6 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse2 (not .cse3) .cse4 (not (= (+ .cse5 1) 0))) (or .cse2 .cse3 .cse4 (not (= .cse5 1))))) .cse7 .cse8 .cse9) (or .cse0 (< c_~back~0 .cse10) (= .cse10 c_~back~0) .cse1 .cse7 .cse8 .cse9)))) is different from false [2023-11-17 16:34:33,011 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~front~0 1))) (let ((.cse0 (< c_~n~0 .cse10)) (.cse1 (= .cse10 c_~n~0)) (.cse7 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse8 (< c_~front~0 0)) (.cse9 (let ((.cse13 (* c_~front~0 4))) (let ((.cse11 (select .cse6 (+ c_~queue~0.offset .cse13))) (.cse12 (+ c_~queue~0.offset .cse13 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)) 1))))))) (and (= c_~v_assert~0 1) (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (or .cse0 .cse1 (let ((.cse2 (< c_~back~0 c_~front~0)) (.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse4 (= c_~back~0 c_~front~0)) (.cse5 (select .cse6 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse2 (not .cse3) .cse4 (not (= (+ .cse5 1) 0))) (or .cse2 .cse3 .cse4 (not (= .cse5 1))))) .cse7 .cse8 .cse9) (or .cse0 (< c_~back~0 .cse10) (= .cse10 c_~back~0) .cse1 .cse7 .cse8 .cse9)))) is different from false [2023-11-17 16:34:40,313 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~front~0 1))) (let ((.cse0 (< c_~n~0 .cse10)) (.cse1 (= .cse10 c_~n~0)) (.cse7 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse8 (< c_~front~0 0)) (.cse9 (let ((.cse13 (* c_~front~0 4))) (let ((.cse11 (select .cse6 (+ c_~queue~0.offset .cse13))) (.cse12 (+ c_~queue~0.offset .cse13 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)) 1))))))) (and (= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (or .cse0 .cse1 (let ((.cse2 (< c_~back~0 c_~front~0)) (.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse4 (= c_~back~0 c_~front~0)) (.cse5 (select .cse6 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse2 (not .cse3) .cse4 (not (= (+ .cse5 1) 0))) (or .cse2 .cse3 .cse4 (not (= .cse5 1))))) .cse7 .cse8 .cse9) (or .cse0 (< c_~back~0 .cse10) (= .cse10 c_~back~0) .cse1 .cse7 .cse8 .cse9) (= c_~sum~0 0)))) is different from false [2023-11-17 16:34:42,007 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~front~0 1))) (let ((.cse0 (< c_~n~0 .cse10)) (.cse1 (= .cse10 c_~n~0)) (.cse7 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse8 (< c_~front~0 0)) (.cse9 (let ((.cse13 (* c_~front~0 4))) (let ((.cse11 (select .cse6 (+ c_~queue~0.offset .cse13))) (.cse12 (+ c_~queue~0.offset .cse13 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse12)) 1))))))) (and (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or .cse0 .cse1 (let ((.cse2 (< c_~back~0 c_~front~0)) (.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse4 (= c_~back~0 c_~front~0)) (.cse5 (select .cse6 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse2 (not .cse3) .cse4 (not (= (+ .cse5 1) 0))) (or .cse2 .cse3 .cse4 (not (= .cse5 1))))) .cse7 .cse8 .cse9) (or .cse0 (< c_~back~0 .cse10) (= .cse10 c_~back~0) .cse1 .cse7 .cse8 .cse9)))) is different from false [2023-11-17 16:34:43,788 WARN L854 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (let ((.cse0 (+ c_~front~0 1))) (or (< c_~n~0 .cse0) (< c_~back~0 .cse0) (= .cse0 c_~back~0) (= .cse0 c_~n~0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< c_~front~0 0) (let ((.cse3 (* c_~front~0 4))) (let ((.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3))) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_411 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_411 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_411) c_~queue~0.base) .cse2)) 1))))))) (= c_~sum~0 0)) is different from false [2023-11-17 16:34:52,781 INFO L124 PetriNetUnfolderBase]: 27100/46342 cut-off events. [2023-11-17 16:34:52,789 INFO L125 PetriNetUnfolderBase]: For 2931441/2931441 co-relation queries the response was YES. [2023-11-17 16:34:54,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513212 conditions, 46342 events. 27100/46342 cut-off events. For 2931441/2931441 co-relation queries the response was YES. Maximal size of possible extension queue 1367. Compared 386184 event pairs, 3534 based on Foata normal form. 339/46681 useless extension candidates. Maximal degree in co-relation 513043. Up to 21883 conditions per place. [2023-11-17 16:34:54,740 INFO L140 encePairwiseOnDemand]: 255/272 looper letters, 3379 selfloop transitions, 2687 changer transitions 18/6084 dead transitions. [2023-11-17 16:34:54,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 6084 transitions, 104901 flow [2023-11-17 16:34:54,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-11-17 16:34:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2023-11-17 16:34:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 8673 transitions. [2023-11-17 16:34:54,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30081159822419534 [2023-11-17 16:34:54,749 INFO L72 ComplementDD]: Start complementDD. Operand 106 states and 8673 transitions. [2023-11-17 16:34:54,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 8673 transitions. [2023-11-17 16:34:54,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:34:54,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 106 states and 8673 transitions. [2023-11-17 16:34:54,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 107 states, 106 states have (on average 81.82075471698113) internal successors, (8673), 106 states have internal predecessors, (8673), 0 states have call successors, (0), 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 16:34:54,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 107 states, 107 states have (on average 272.0) internal successors, (29104), 107 states have internal predecessors, (29104), 0 states have call successors, (0), 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 16:34:54,795 INFO L81 ComplementDD]: Finished complementDD. Result has 107 states, 107 states have (on average 272.0) internal successors, (29104), 107 states have internal predecessors, (29104), 0 states have call successors, (0), 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 16:34:54,795 INFO L175 Difference]: Start difference. First operand has 635 places, 2499 transitions, 36822 flow. Second operand 106 states and 8673 transitions. [2023-11-17 16:34:54,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 6084 transitions, 104901 flow [2023-11-17 16:35:25,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 6084 transitions, 98161 flow, removed 3305 selfloop flow, removed 29 redundant places. [2023-11-17 16:35:25,478 INFO L231 Difference]: Finished difference. Result has 749 places, 4391 transitions, 72463 flow [2023-11-17 16:35:25,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=33422, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=72463, PETRI_PLACES=749, PETRI_TRANSITIONS=4391} [2023-11-17 16:35:25,481 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 718 predicate places. [2023-11-17 16:35:25,481 INFO L495 AbstractCegarLoop]: Abstraction has has 749 places, 4391 transitions, 72463 flow [2023-11-17 16:35:25,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 76.89473684210526) internal successors, (2922), 38 states have internal predecessors, (2922), 0 states have call successors, (0), 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 16:35:25,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:35:25,482 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:35:25,489 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 16:35:25,689 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,SelfDestructingSolverStorable14 [2023-11-17 16:35:25,689 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:35:25,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:35:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1656300630, now seen corresponding path program 11 times [2023-11-17 16:35:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:35:25,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188868889] [2023-11-17 16:35:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:35:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:35:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:35:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:35:27,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:35:27,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188868889] [2023-11-17 16:35:27,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188868889] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:35:27,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829855528] [2023-11-17 16:35:27,515 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:35:27,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:35:27,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:35:27,517 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 16:35:27,537 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 16:35:27,646 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-17 16:35:27,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:35:27,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-17 16:35:27,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:35:27,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:35:27,943 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 27 [2023-11-17 16:35:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:35:28,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:35:28,155 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4 4)) (.cse2 (+ c_~queue~0.offset .cse4))) (and (forall ((v_ArrVal_452 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) 1)) (forall ((v_ArrVal_452 (Array Int Int))) (<= 0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2)))))))) is different from false [2023-11-17 16:35:28,278 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-17 16:35:28,279 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 222 treesize of output 192 [2023-11-17 16:35:28,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:35:28,289 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 71 treesize of output 58 [2023-11-17 16:35:28,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:35:28,300 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 58 treesize of output 45 [2023-11-17 16:35:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:35:28,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829855528] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:35:28,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:35:28,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2023-11-17 16:35:28,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009005788] [2023-11-17 16:35:28,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:35:28,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-17 16:35:28,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:35:28,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-17 16:35:28,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1053, Unknown=1, NotChecked=66, Total=1260 [2023-11-17 16:35:28,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 272 [2023-11-17 16:35:28,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 4391 transitions, 72463 flow. Second operand has 36 states, 36 states have (on average 70.97222222222223) internal successors, (2555), 36 states have internal predecessors, (2555), 0 states have call successors, (0), 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 16:35:28,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:35:28,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 272 [2023-11-17 16:35:28,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:35:31,309 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse8 4)) (.cse6 (+ c_~queue~0.offset .cse8))) (let ((.cse0 (forall ((v_ArrVal_452 (Array Int Int))) (<= (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse5) (select .cse7 .cse6))) 1))) (.cse1 (forall ((v_ArrVal_452 (Array Int Int))) (<= 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))))))) (and (= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) .cse0 (= c_~v_assert~0 1) .cse1 (<= 0 c_~sum~0) (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1)) (<= c_~sum~0 1))))) is different from false [2023-11-17 16:35:33,260 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse8 4)) (.cse6 (+ c_~queue~0.offset .cse8))) (let ((.cse0 (forall ((v_ArrVal_452 (Array Int Int))) (<= (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse5) (select .cse7 .cse6))) 1))) (.cse1 (forall ((v_ArrVal_452 (Array Int Int))) (<= 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))))))) (and .cse0 .cse1 (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1)))))) is different from false [2023-11-17 16:36:35,392 INFO L124 PetriNetUnfolderBase]: 36425/61699 cut-off events. [2023-11-17 16:36:35,392 INFO L125 PetriNetUnfolderBase]: For 7286363/7286363 co-relation queries the response was YES. [2023-11-17 16:36:37,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971199 conditions, 61699 events. 36425/61699 cut-off events. For 7286363/7286363 co-relation queries the response was YES. Maximal size of possible extension queue 1976. Compared 531355 event pairs, 3435 based on Foata normal form. 496/62195 useless extension candidates. Maximal degree in co-relation 970992. Up to 28772 conditions per place. [2023-11-17 16:36:37,901 INFO L140 encePairwiseOnDemand]: 257/272 looper letters, 4335 selfloop transitions, 1764 changer transitions 1025/7124 dead transitions. [2023-11-17 16:36:37,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 804 places, 7124 transitions, 138457 flow [2023-11-17 16:36:37,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-17 16:36:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-11-17 16:36:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 4175 transitions. [2023-11-17 16:36:37,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.274094012605042 [2023-11-17 16:36:37,906 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 4175 transitions. [2023-11-17 16:36:37,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 4175 transitions. [2023-11-17 16:36:37,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:36:37,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 4175 transitions. [2023-11-17 16:36:37,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 74.55357142857143) internal successors, (4175), 56 states have internal predecessors, (4175), 0 states have call successors, (0), 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 16:36:37,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 272.0) internal successors, (15504), 57 states have internal predecessors, (15504), 0 states have call successors, (0), 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 16:36:37,923 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 272.0) internal successors, (15504), 57 states have internal predecessors, (15504), 0 states have call successors, (0), 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 16:36:37,923 INFO L175 Difference]: Start difference. First operand has 749 places, 4391 transitions, 72463 flow. Second operand 56 states and 4175 transitions. [2023-11-17 16:36:37,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 804 places, 7124 transitions, 138457 flow [2023-11-17 16:38:44,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 789 places, 7124 transitions, 133763 flow, removed 2297 selfloop flow, removed 15 redundant places. [2023-11-17 16:38:44,556 INFO L231 Difference]: Finished difference. Result has 806 places, 5022 transitions, 89084 flow [2023-11-17 16:38:44,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=70085, PETRI_DIFFERENCE_MINUEND_PLACES=734, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3031, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=89084, PETRI_PLACES=806, PETRI_TRANSITIONS=5022} [2023-11-17 16:38:44,561 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 775 predicate places. [2023-11-17 16:38:44,561 INFO L495 AbstractCegarLoop]: Abstraction has has 806 places, 5022 transitions, 89084 flow [2023-11-17 16:38:44,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 70.97222222222223) internal successors, (2555), 36 states have internal predecessors, (2555), 0 states have call successors, (0), 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 16:38:44,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:38:44,562 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:38:44,572 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 16:38:44,772 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,SelfDestructingSolverStorable15 [2023-11-17 16:38:44,772 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:38:44,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:38:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1442931098, now seen corresponding path program 12 times [2023-11-17 16:38:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:38:44,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276198810] [2023-11-17 16:38:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:38:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:38:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:38:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:38:46,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:38:46,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276198810] [2023-11-17 16:38:46,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276198810] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:38:46,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825938011] [2023-11-17 16:38:46,214 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:38:46,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:38:46,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:38:46,215 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 16:38:46,217 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 16:38:46,386 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-17 16:38:46,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:38:46,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 16:38:46,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:38:46,512 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 12 treesize of output 3 [2023-11-17 16:38:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:38:46,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:38:46,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:46,711 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 104 treesize of output 80 [2023-11-17 16:38:47,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:38:47,041 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 171 treesize of output 131 [2023-11-17 16:38:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:38:47,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825938011] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:38:47,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:38:47,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 30 [2023-11-17 16:38:47,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334376581] [2023-11-17 16:38:47,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:38:47,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 16:38:47,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:38:47,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 16:38:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2023-11-17 16:38:47,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 272 [2023-11-17 16:38:47,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 806 places, 5022 transitions, 89084 flow. Second operand has 31 states, 31 states have (on average 82.51612903225806) internal successors, (2558), 31 states have internal predecessors, (2558), 0 states have call successors, (0), 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 16:38:47,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:38:47,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 272 [2023-11-17 16:38:47,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand