/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-more-sorted.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:24:03,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:24:03,261 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:24:03,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:24:03,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:24:03,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:24:03,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:24:03,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:24:03,285 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:24:03,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:24:03,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:24:03,286 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:24:03,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:24:03,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:24:03,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:24:03,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:24:03,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:24:03,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:24:03,288 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:24:03,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:24:03,289 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:24:03,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:24:03,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:24:03,290 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:24:03,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:24:03,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:24:03,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:24:03,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:24:03,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:24:03,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:24:03,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:24:03,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:24:03,293 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:24:03,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:24:03,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:24:03,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:24:03,515 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:24:03,515 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:24:03,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-11-17 16:24:04,745 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:24:04,947 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:24:04,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2023-11-17 16:24:04,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef6d8a4f/ebb932db0f5c4d258f5eb80077c5aa62/FLAG252755e08 [2023-11-17 16:24:04,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef6d8a4f/ebb932db0f5c4d258f5eb80077c5aa62 [2023-11-17 16:24:04,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:24:04,979 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:24:04,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:24:04,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:24:04,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:24:04,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:24:04" (1/1) ... [2023-11-17 16:24:04,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e42ae86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:04, skipping insertion in model container [2023-11-17 16:24:04,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:24:04" (1/1) ... [2023-11-17 16:24:05,016 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:24:05,155 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-more-sorted.wvr.c[2473,2486] [2023-11-17 16:24:05,162 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:24:05,170 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:24:05,190 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-more-sorted.wvr.c[2473,2486] [2023-11-17 16:24:05,193 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:24:05,203 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:24:05,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:05 WrapperNode [2023-11-17 16:24:05,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:24:05,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:24:05,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:24:05,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:24:05,209 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:24:05" (1/1) ... [2023-11-17 16:24:05,217 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:24:05" (1/1) ... [2023-11-17 16:24:05,236 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 108 [2023-11-17 16:24:05,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:24:05,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:24:05,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:24:05,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:24:05,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:05" (1/1) ... [2023-11-17 16:24:05,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:05" (1/1) ... [2023-11-17 16:24:05,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:05" (1/1) ... [2023-11-17 16:24:05,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:05" (1/1) ... [2023-11-17 16:24:05,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:05" (1/1) ... [2023-11-17 16:24:05,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:05" (1/1) ... [2023-11-17 16:24:05,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:05" (1/1) ... [2023-11-17 16:24:05,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:05" (1/1) ... [2023-11-17 16:24:05,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:24:05,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:24:05,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:24:05,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:24:05,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:05" (1/1) ... [2023-11-17 16:24:05,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:24:05,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:05,326 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:24:05,349 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:24:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:24:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:24:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:24:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:24:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:24:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 16:24:05,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 16:24:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:24:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:24:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:24:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:24:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:24:05,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:24:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:24:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:24:05,365 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:24:05,507 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:24:05,509 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:24:05,828 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:24:05,845 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:24:05,845 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 16:24:05,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:24:05 BoogieIcfgContainer [2023-11-17 16:24:05,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:24:05,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:24:05,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:24:05,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:24:05,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:24:04" (1/3) ... [2023-11-17 16:24:05,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7a181c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:24:05, skipping insertion in model container [2023-11-17 16:24:05,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:24:05" (2/3) ... [2023-11-17 16:24:05,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7a181c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:24:05, skipping insertion in model container [2023-11-17 16:24:05,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:24:05" (3/3) ... [2023-11-17 16:24:05,855 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2023-11-17 16:24:05,870 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:24:05,870 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:24:05,870 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:24:05,946 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 16:24:05,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 190 transitions, 401 flow [2023-11-17 16:24:06,060 INFO L124 PetriNetUnfolderBase]: 15/187 cut-off events. [2023-11-17 16:24:06,061 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:24:06,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 15/187 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 234 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2023-11-17 16:24:06,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 190 transitions, 401 flow [2023-11-17 16:24:06,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 176 transitions, 370 flow [2023-11-17 16:24:06,083 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:24:06,095 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 176 transitions, 370 flow [2023-11-17 16:24:06,097 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 176 transitions, 370 flow [2023-11-17 16:24:06,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 176 transitions, 370 flow [2023-11-17 16:24:06,159 INFO L124 PetriNetUnfolderBase]: 15/176 cut-off events. [2023-11-17 16:24:06,159 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:24:06,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 176 events. 15/176 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 231 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2023-11-17 16:24:06,164 INFO L119 LiptonReduction]: Number of co-enabled transitions 4158 [2023-11-17 16:24:11,905 INFO L134 LiptonReduction]: Checked pairs total: 4781 [2023-11-17 16:24:11,905 INFO L136 LiptonReduction]: Total number of compositions: 183 [2023-11-17 16:24:11,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:24:11,926 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;@4c317de0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:24:11,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 16:24:11,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:24:11,933 INFO L124 PetriNetUnfolderBase]: 6/27 cut-off events. [2023-11-17 16:24:11,934 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:24:11,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:11,934 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] [2023-11-17 16:24:11,935 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:24:11,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash -69762334, now seen corresponding path program 1 times [2023-11-17 16:24:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059384787] [2023-11-17 16:24:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:12,472 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:24:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059384787] [2023-11-17 16:24:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059384787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:24:12,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:24:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:24:12,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943795834] [2023-11-17 16:24:12,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:24:12,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:24:12,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:24:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:24:12,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 373 [2023-11-17 16:24:12,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 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:24:12,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:12,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 373 [2023-11-17 16:24:12,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:12,665 INFO L124 PetriNetUnfolderBase]: 440/611 cut-off events. [2023-11-17 16:24:12,666 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-11-17 16:24:12,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 611 events. 440/611 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1609 event pairs, 253 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 1068. Up to 611 conditions per place. [2023-11-17 16:24:12,675 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 27 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-11-17 16:24:12,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 134 flow [2023-11-17 16:24:12,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:24:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:24:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-11-17 16:24:12,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43967828418230565 [2023-11-17 16:24:12,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-11-17 16:24:12,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-11-17 16:24:12,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:12,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-11-17 16:24:12,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 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:24:12,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 373.0) internal successors, (1492), 4 states have internal predecessors, (1492), 0 states have call successors, (0), 0 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:24:12,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 373.0) internal successors, (1492), 4 states have internal predecessors, (1492), 0 states have call successors, (0), 0 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:24:12,714 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 3 states and 492 transitions. [2023-11-17 16:24:12,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 134 flow [2023-11-17 16:24:12,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 122 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-17 16:24:12,720 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 74 flow [2023-11-17 16:24:12,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-11-17 16:24:12,724 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2023-11-17 16:24:12,724 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 74 flow [2023-11-17 16:24:12,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 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:24:12,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:12,725 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:24:12,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:24:12,725 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:24:12,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1711191590, now seen corresponding path program 1 times [2023-11-17 16:24:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:12,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585732825] [2023-11-17 16:24:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:12,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:12,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:12,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585732825] [2023-11-17 16:24:12,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585732825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:24:12,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:24:12,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:24:12,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556569013] [2023-11-17 16:24:12,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:24:12,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:24:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:13,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:24:13,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:24:13,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 373 [2023-11-17 16:24:13,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 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:24:13,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:13,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 373 [2023-11-17 16:24:13,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:13,160 INFO L124 PetriNetUnfolderBase]: 795/1127 cut-off events. [2023-11-17 16:24:13,161 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-17 16:24:13,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2302 conditions, 1127 events. 795/1127 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3856 event pairs, 253 based on Foata normal form. 1/827 useless extension candidates. Maximal degree in co-relation 2291. Up to 707 conditions per place. [2023-11-17 16:24:13,167 INFO L140 encePairwiseOnDemand]: 366/373 looper letters, 45 selfloop transitions, 4 changer transitions 1/50 dead transitions. [2023-11-17 16:24:13,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 50 transitions, 221 flow [2023-11-17 16:24:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:24:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:24:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2023-11-17 16:24:13,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48078641644325293 [2023-11-17 16:24:13,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2023-11-17 16:24:13,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2023-11-17 16:24:13,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:13,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2023-11-17 16:24:13,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 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:24:13,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 373.0) internal successors, (1492), 4 states have internal predecessors, (1492), 0 states have call successors, (0), 0 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:24:13,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 373.0) internal successors, (1492), 4 states have internal predecessors, (1492), 0 states have call successors, (0), 0 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:24:13,176 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 74 flow. Second operand 3 states and 538 transitions. [2023-11-17 16:24:13,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 50 transitions, 221 flow [2023-11-17 16:24:13,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 50 transitions, 217 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 16:24:13,178 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 100 flow [2023-11-17 16:24:13,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2023-11-17 16:24:13,178 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-11-17 16:24:13,179 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 100 flow [2023-11-17 16:24:13,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 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:24:13,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:13,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, 1, 1, 1] [2023-11-17 16:24:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:24:13,180 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:24:13,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:13,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1072614148, now seen corresponding path program 1 times [2023-11-17 16:24:13,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:13,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937146286] [2023-11-17 16:24:13,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:13,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:13,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:13,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937146286] [2023-11-17 16:24:13,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937146286] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:13,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566237519] [2023-11-17 16:24:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:13,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:13,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:13,345 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:24:13,355 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:24:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:13,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:24:13,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:13,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566237519] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:13,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-17 16:24:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578392164] [2023-11-17 16:24:13,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:13,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 16:24:13,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 16:24:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:24:13,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 373 [2023-11-17 16:24:13,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 100 flow. Second operand has 12 states, 12 states have (on average 147.66666666666666) internal successors, (1772), 12 states have internal predecessors, (1772), 0 states have call successors, (0), 0 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:24:13,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:13,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 373 [2023-11-17 16:24:13,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:14,203 INFO L124 PetriNetUnfolderBase]: 1497/2156 cut-off events. [2023-11-17 16:24:14,203 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-11-17 16:24:14,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5106 conditions, 2156 events. 1497/2156 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8565 event pairs, 851 based on Foata normal form. 82/1950 useless extension candidates. Maximal degree in co-relation 2700. Up to 1127 conditions per place. [2023-11-17 16:24:14,216 INFO L140 encePairwiseOnDemand]: 367/373 looper letters, 71 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2023-11-17 16:24:14,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 77 transitions, 389 flow [2023-11-17 16:24:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 16:24:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 16:24:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 935 transitions. [2023-11-17 16:24:14,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41778373547810543 [2023-11-17 16:24:14,219 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 935 transitions. [2023-11-17 16:24:14,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 935 transitions. [2023-11-17 16:24:14,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:14,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 935 transitions. [2023-11-17 16:24:14,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 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:24:14,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 373.0) internal successors, (2611), 7 states have internal predecessors, (2611), 0 states have call successors, (0), 0 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:24:14,226 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 373.0) internal successors, (2611), 7 states have internal predecessors, (2611), 0 states have call successors, (0), 0 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:24:14,226 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 100 flow. Second operand 6 states and 935 transitions. [2023-11-17 16:24:14,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 77 transitions, 389 flow [2023-11-17 16:24:14,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 77 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:24:14,229 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 142 flow [2023-11-17 16:24:14,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2023-11-17 16:24:14,230 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-11-17 16:24:14,230 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 142 flow [2023-11-17 16:24:14,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 147.66666666666666) internal successors, (1772), 12 states have internal predecessors, (1772), 0 states have call successors, (0), 0 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:24:14,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:14,232 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] [2023-11-17 16:24:14,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 16:24:14,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:14,438 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:24:14,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash 833892620, now seen corresponding path program 2 times [2023-11-17 16:24:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345624526] [2023-11-17 16:24:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:14,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345624526] [2023-11-17 16:24:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345624526] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685486616] [2023-11-17 16:24:14,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:24:14,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:14,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:14,588 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:24:14,607 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:24:14,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:24:14,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:14,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 16:24:14,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:14,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685486616] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:24:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2023-11-17 16:24:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592829824] [2023-11-17 16:24:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:24:14,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 16:24:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:14,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 16:24:14,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:24:14,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 373 [2023-11-17 16:24:14,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 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:24:14,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:14,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 373 [2023-11-17 16:24:14,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:15,139 INFO L124 PetriNetUnfolderBase]: 1468/2090 cut-off events. [2023-11-17 16:24:15,139 INFO L125 PetriNetUnfolderBase]: For 876/876 co-relation queries the response was YES. [2023-11-17 16:24:15,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5363 conditions, 2090 events. 1468/2090 cut-off events. For 876/876 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8313 event pairs, 600 based on Foata normal form. 0/1842 useless extension candidates. Maximal degree in co-relation 2699. Up to 813 conditions per place. [2023-11-17 16:24:15,153 INFO L140 encePairwiseOnDemand]: 365/373 looper letters, 78 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2023-11-17 16:24:15,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 90 transitions, 488 flow [2023-11-17 16:24:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 16:24:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 16:24:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1119 transitions. [2023-11-17 16:24:15,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-11-17 16:24:15,157 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1119 transitions. [2023-11-17 16:24:15,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1119 transitions. [2023-11-17 16:24:15,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:15,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1119 transitions. [2023-11-17 16:24:15,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.85714285714286) internal successors, (1119), 7 states have internal predecessors, (1119), 0 states have call successors, (0), 0 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:24:15,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 373.0) internal successors, (2984), 8 states have internal predecessors, (2984), 0 states have call successors, (0), 0 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:24:15,165 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 373.0) internal successors, (2984), 8 states have internal predecessors, (2984), 0 states have call successors, (0), 0 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:24:15,165 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 142 flow. Second operand 7 states and 1119 transitions. [2023-11-17 16:24:15,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 90 transitions, 488 flow [2023-11-17 16:24:15,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 90 transitions, 478 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 16:24:15,172 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 193 flow [2023-11-17 16:24:15,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2023-11-17 16:24:15,173 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-11-17 16:24:15,174 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 193 flow [2023-11-17 16:24:15,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 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:24:15,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:15,175 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:24:15,183 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:24:15,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-17 16:24:15,383 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:24:15,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:15,384 INFO L85 PathProgramCache]: Analyzing trace with hash -930533305, now seen corresponding path program 1 times [2023-11-17 16:24:15,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:15,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393559479] [2023-11-17 16:24:15,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:15,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:15,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:15,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393559479] [2023-11-17 16:24:15,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393559479] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:15,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11252828] [2023-11-17 16:24:15,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:15,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:15,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:15,488 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:24:15,506 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:24:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:15,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 16:24:15,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:15,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11252828] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:15,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:15,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-17 16:24:15,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770890556] [2023-11-17 16:24:15,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:15,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 16:24:15,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:15,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 16:24:15,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-17 16:24:15,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 373 [2023-11-17 16:24:15,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 193 flow. Second operand has 12 states, 12 states have (on average 150.91666666666666) internal successors, (1811), 12 states have internal predecessors, (1811), 0 states have call successors, (0), 0 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:24:15,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:15,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 373 [2023-11-17 16:24:15,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:15,961 INFO L124 PetriNetUnfolderBase]: 1180/1708 cut-off events. [2023-11-17 16:24:15,961 INFO L125 PetriNetUnfolderBase]: For 1550/1550 co-relation queries the response was YES. [2023-11-17 16:24:15,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5002 conditions, 1708 events. 1180/1708 cut-off events. For 1550/1550 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6536 event pairs, 704 based on Foata normal form. 82/1660 useless extension candidates. Maximal degree in co-relation 3204. Up to 1061 conditions per place. [2023-11-17 16:24:15,973 INFO L140 encePairwiseOnDemand]: 366/373 looper letters, 65 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2023-11-17 16:24:15,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 415 flow [2023-11-17 16:24:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 16:24:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 16:24:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 954 transitions. [2023-11-17 16:24:15,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4262734584450402 [2023-11-17 16:24:15,976 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 954 transitions. [2023-11-17 16:24:15,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 954 transitions. [2023-11-17 16:24:15,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:15,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 954 transitions. [2023-11-17 16:24:15,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 0 states have call successors, (0), 0 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:24:15,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 373.0) internal successors, (2611), 7 states have internal predecessors, (2611), 0 states have call successors, (0), 0 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:24:15,982 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 373.0) internal successors, (2611), 7 states have internal predecessors, (2611), 0 states have call successors, (0), 0 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:24:15,982 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 193 flow. Second operand 6 states and 954 transitions. [2023-11-17 16:24:15,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 415 flow [2023-11-17 16:24:15,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 408 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 16:24:15,987 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 192 flow [2023-11-17 16:24:15,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-11-17 16:24:15,988 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-11-17 16:24:15,988 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 192 flow [2023-11-17 16:24:15,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 150.91666666666666) internal successors, (1811), 12 states have internal predecessors, (1811), 0 states have call successors, (0), 0 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:24:15,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:15,989 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:24:15,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 16:24:16,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:16,195 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:24:16,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2018482001, now seen corresponding path program 1 times [2023-11-17 16:24:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:16,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863258899] [2023-11-17 16:24:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:16,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863258899] [2023-11-17 16:24:16,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863258899] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629193375] [2023-11-17 16:24:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:16,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:16,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:16,361 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:24:16,392 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:24:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:16,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:24:16,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:16,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:16,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629193375] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:16,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:16,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-11-17 16:24:16,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290078816] [2023-11-17 16:24:16,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:16,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 16:24:16,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:16,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 16:24:16,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-17 16:24:16,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 373 [2023-11-17 16:24:16,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 192 flow. Second operand has 13 states, 13 states have (on average 146.15384615384616) internal successors, (1900), 13 states have internal predecessors, (1900), 0 states have call successors, (0), 0 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:24:16,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:16,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 373 [2023-11-17 16:24:16,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:16,847 INFO L124 PetriNetUnfolderBase]: 904/1304 cut-off events. [2023-11-17 16:24:16,847 INFO L125 PetriNetUnfolderBase]: For 1568/1568 co-relation queries the response was YES. [2023-11-17 16:24:16,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4039 conditions, 1304 events. 904/1304 cut-off events. For 1568/1568 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4589 event pairs, 548 based on Foata normal form. 0/1234 useless extension candidates. Maximal degree in co-relation 3281. Up to 1061 conditions per place. [2023-11-17 16:24:16,856 INFO L140 encePairwiseOnDemand]: 367/373 looper letters, 32 selfloop transitions, 3 changer transitions 27/62 dead transitions. [2023-11-17 16:24:16,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 386 flow [2023-11-17 16:24:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 16:24:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 16:24:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 916 transitions. [2023-11-17 16:24:16,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092940125111707 [2023-11-17 16:24:16,859 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 916 transitions. [2023-11-17 16:24:16,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 916 transitions. [2023-11-17 16:24:16,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:16,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 916 transitions. [2023-11-17 16:24:16,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.66666666666666) internal successors, (916), 6 states have internal predecessors, (916), 0 states have call successors, (0), 0 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:24:16,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 373.0) internal successors, (2611), 7 states have internal predecessors, (2611), 0 states have call successors, (0), 0 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:24:16,865 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 373.0) internal successors, (2611), 7 states have internal predecessors, (2611), 0 states have call successors, (0), 0 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:24:16,865 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 192 flow. Second operand 6 states and 916 transitions. [2023-11-17 16:24:16,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 386 flow [2023-11-17 16:24:16,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 365 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-17 16:24:16,870 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 156 flow [2023-11-17 16:24:16,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2023-11-17 16:24:16,872 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-11-17 16:24:16,872 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 156 flow [2023-11-17 16:24:16,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 146.15384615384616) internal successors, (1900), 13 states have internal predecessors, (1900), 0 states have call successors, (0), 0 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:24:16,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:16,873 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] [2023-11-17 16:24:16,884 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:24:17,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:17,079 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:24:17,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1805887645, now seen corresponding path program 2 times [2023-11-17 16:24:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:17,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287966910] [2023-11-17 16:24:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:17,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:17,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287966910] [2023-11-17 16:24:17,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287966910] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:17,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302086585] [2023-11-17 16:24:17,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:24:17,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:17,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:17,238 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:24:17,262 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:24:17,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:24:17,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:17,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 16:24:17,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:17,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:17,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302086585] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:17,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:17,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-11-17 16:24:17,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132211420] [2023-11-17 16:24:17,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:17,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 16:24:17,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:17,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 16:24:17,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-11-17 16:24:17,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 373 [2023-11-17 16:24:17,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 156 flow. Second operand has 16 states, 16 states have (on average 140.625) internal successors, (2250), 16 states have internal predecessors, (2250), 0 states have call successors, (0), 0 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:24:17,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:17,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 373 [2023-11-17 16:24:17,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:18,027 INFO L124 PetriNetUnfolderBase]: 1137/1571 cut-off events. [2023-11-17 16:24:18,027 INFO L125 PetriNetUnfolderBase]: For 1969/1969 co-relation queries the response was YES. [2023-11-17 16:24:18,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5067 conditions, 1571 events. 1137/1571 cut-off events. For 1969/1969 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5601 event pairs, 310 based on Foata normal form. 16/1479 useless extension candidates. Maximal degree in co-relation 5043. Up to 853 conditions per place. [2023-11-17 16:24:18,039 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 79 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2023-11-17 16:24:18,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 91 transitions, 594 flow [2023-11-17 16:24:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:24:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 16:24:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1318 transitions. [2023-11-17 16:24:18,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39261245159368485 [2023-11-17 16:24:18,043 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1318 transitions. [2023-11-17 16:24:18,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1318 transitions. [2023-11-17 16:24:18,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:18,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1318 transitions. [2023-11-17 16:24:18,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 146.44444444444446) internal successors, (1318), 9 states have internal predecessors, (1318), 0 states have call successors, (0), 0 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:24:18,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 373.0) internal successors, (3730), 10 states have internal predecessors, (3730), 0 states have call successors, (0), 0 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:24:18,053 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 373.0) internal successors, (3730), 10 states have internal predecessors, (3730), 0 states have call successors, (0), 0 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:24:18,053 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 156 flow. Second operand 9 states and 1318 transitions. [2023-11-17 16:24:18,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 91 transitions, 594 flow [2023-11-17 16:24:18,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 91 transitions, 530 flow, removed 29 selfloop flow, removed 8 redundant places. [2023-11-17 16:24:18,063 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 200 flow [2023-11-17 16:24:18,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=200, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-11-17 16:24:18,065 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-11-17 16:24:18,065 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 200 flow [2023-11-17 16:24:18,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 140.625) internal successors, (2250), 16 states have internal predecessors, (2250), 0 states have call successors, (0), 0 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:24:18,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:18,066 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] [2023-11-17 16:24:18,072 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:24:18,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:18,272 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:24:18,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2061899769, now seen corresponding path program 3 times [2023-11-17 16:24:18,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:18,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690598649] [2023-11-17 16:24:18,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:18,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:18,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690598649] [2023-11-17 16:24:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690598649] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100479920] [2023-11-17 16:24:18,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:24:18,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:18,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:18,435 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:24:18,455 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:24:18,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:24:18,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:18,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 16:24:18,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:18,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:18,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100479920] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:18,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:24:18,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2023-11-17 16:24:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121033515] [2023-11-17 16:24:18,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:24:18,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 16:24:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:18,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 16:24:18,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-11-17 16:24:18,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 373 [2023-11-17 16:24:18,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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:24:18,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:18,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 373 [2023-11-17 16:24:18,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:19,113 INFO L124 PetriNetUnfolderBase]: 1581/2177 cut-off events. [2023-11-17 16:24:19,113 INFO L125 PetriNetUnfolderBase]: For 2911/2911 co-relation queries the response was YES. [2023-11-17 16:24:19,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7218 conditions, 2177 events. 1581/2177 cut-off events. For 2911/2911 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7998 event pairs, 365 based on Foata normal form. 14/2191 useless extension candidates. Maximal degree in co-relation 7186. Up to 1030 conditions per place. [2023-11-17 16:24:19,128 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 104 selfloop transitions, 28 changer transitions 0/132 dead transitions. [2023-11-17 16:24:19,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 132 transitions, 893 flow [2023-11-17 16:24:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:24:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:24:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1478 transitions. [2023-11-17 16:24:19,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3962466487935657 [2023-11-17 16:24:19,133 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1478 transitions. [2023-11-17 16:24:19,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1478 transitions. [2023-11-17 16:24:19,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:19,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1478 transitions. [2023-11-17 16:24:19,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 147.8) internal successors, (1478), 10 states have internal predecessors, (1478), 0 states have call successors, (0), 0 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:24:19,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 373.0) internal successors, (4103), 11 states have internal predecessors, (4103), 0 states have call successors, (0), 0 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:24:19,142 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 373.0) internal successors, (4103), 11 states have internal predecessors, (4103), 0 states have call successors, (0), 0 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:24:19,142 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 200 flow. Second operand 10 states and 1478 transitions. [2023-11-17 16:24:19,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 132 transitions, 893 flow [2023-11-17 16:24:19,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 132 transitions, 870 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-17 16:24:19,147 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 373 flow [2023-11-17 16:24:19,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=373, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2023-11-17 16:24:19,148 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2023-11-17 16:24:19,148 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 58 transitions, 373 flow [2023-11-17 16:24:19,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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:24:19,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:19,149 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] [2023-11-17 16:24:19,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 16:24:19,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:19,355 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:24:19,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:19,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1338740991, now seen corresponding path program 4 times [2023-11-17 16:24:19,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:19,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045326860] [2023-11-17 16:24:19,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:19,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:19,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:19,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045326860] [2023-11-17 16:24:19,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045326860] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:19,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836923323] [2023-11-17 16:24:19,478 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:24:19,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:19,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:19,479 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:24:19,499 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:24:19,584 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:24:19,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:19,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 16:24:19,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:19,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:19,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836923323] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:19,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:19,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-11-17 16:24:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748454440] [2023-11-17 16:24:19,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:19,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 16:24:19,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:19,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 16:24:19,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-11-17 16:24:19,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 373 [2023-11-17 16:24:19,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 58 transitions, 373 flow. Second operand has 17 states, 17 states have (on average 141.11764705882354) internal successors, (2399), 17 states have internal predecessors, (2399), 0 states have call successors, (0), 0 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:24:19,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:19,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 373 [2023-11-17 16:24:19,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:20,526 INFO L124 PetriNetUnfolderBase]: 2046/2816 cut-off events. [2023-11-17 16:24:20,527 INFO L125 PetriNetUnfolderBase]: For 6621/6621 co-relation queries the response was YES. [2023-11-17 16:24:20,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11300 conditions, 2816 events. 2046/2816 cut-off events. For 6621/6621 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10923 event pairs, 527 based on Foata normal form. 16/2832 useless extension candidates. Maximal degree in co-relation 11264. Up to 1672 conditions per place. [2023-11-17 16:24:20,548 INFO L140 encePairwiseOnDemand]: 361/373 looper letters, 121 selfloop transitions, 52 changer transitions 0/173 dead transitions. [2023-11-17 16:24:20,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 173 transitions, 1369 flow [2023-11-17 16:24:20,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 16:24:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 16:24:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1772 transitions. [2023-11-17 16:24:20,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958891867739053 [2023-11-17 16:24:20,554 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1772 transitions. [2023-11-17 16:24:20,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1772 transitions. [2023-11-17 16:24:20,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:20,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1772 transitions. [2023-11-17 16:24:20,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.66666666666666) internal successors, (1772), 12 states have internal predecessors, (1772), 0 states have call successors, (0), 0 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:24:20,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 373.0) internal successors, (4849), 13 states have internal predecessors, (4849), 0 states have call successors, (0), 0 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:24:20,565 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 373.0) internal successors, (4849), 13 states have internal predecessors, (4849), 0 states have call successors, (0), 0 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:24:20,565 INFO L175 Difference]: Start difference. First operand has 55 places, 58 transitions, 373 flow. Second operand 12 states and 1772 transitions. [2023-11-17 16:24:20,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 173 transitions, 1369 flow [2023-11-17 16:24:20,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 173 transitions, 1308 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-11-17 16:24:20,587 INFO L231 Difference]: Finished difference. Result has 68 places, 92 transitions, 794 flow [2023-11-17 16:24:20,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=794, PETRI_PLACES=68, PETRI_TRANSITIONS=92} [2023-11-17 16:24:20,588 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2023-11-17 16:24:20,588 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 92 transitions, 794 flow [2023-11-17 16:24:20,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 141.11764705882354) internal successors, (2399), 17 states have internal predecessors, (2399), 0 states have call successors, (0), 0 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:24:20,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:20,589 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] [2023-11-17 16:24:20,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-17 16:24:20,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:20,798 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:24:20,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:20,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1419466781, now seen corresponding path program 5 times [2023-11-17 16:24:20,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:20,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908382982] [2023-11-17 16:24:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:20,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:20,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:20,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908382982] [2023-11-17 16:24:20,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908382982] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:20,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782708515] [2023-11-17 16:24:20,932 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:24:20,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:20,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:20,933 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:24:20,953 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:24:21,039 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:24:21,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:21,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 16:24:21,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:24:21,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:24:21,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782708515] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:21,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:21,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-17 16:24:21,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279367247] [2023-11-17 16:24:21,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:21,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:24:21,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:21,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:24:21,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:24:21,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 373 [2023-11-17 16:24:21,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 92 transitions, 794 flow. Second operand has 14 states, 14 states have (on average 134.78571428571428) internal successors, (1887), 14 states have internal predecessors, (1887), 0 states have call successors, (0), 0 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:24:21,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:21,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 373 [2023-11-17 16:24:21,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:22,251 INFO L124 PetriNetUnfolderBase]: 2102/2900 cut-off events. [2023-11-17 16:24:22,252 INFO L125 PetriNetUnfolderBase]: For 10453/10453 co-relation queries the response was YES. [2023-11-17 16:24:22,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13591 conditions, 2900 events. 2102/2900 cut-off events. For 10453/10453 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11605 event pairs, 141 based on Foata normal form. 16/2916 useless extension candidates. Maximal degree in co-relation 13548. Up to 1091 conditions per place. [2023-11-17 16:24:22,283 INFO L140 encePairwiseOnDemand]: 359/373 looper letters, 171 selfloop transitions, 148 changer transitions 0/319 dead transitions. [2023-11-17 16:24:22,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 319 transitions, 3038 flow [2023-11-17 16:24:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 16:24:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-17 16:24:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3229 transitions. [2023-11-17 16:24:22,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37638419396200024 [2023-11-17 16:24:22,292 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3229 transitions. [2023-11-17 16:24:22,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3229 transitions. [2023-11-17 16:24:22,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:22,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3229 transitions. [2023-11-17 16:24:22,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 140.3913043478261) internal successors, (3229), 23 states have internal predecessors, (3229), 0 states have call successors, (0), 0 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:24:22,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 373.0) internal successors, (8952), 24 states have internal predecessors, (8952), 0 states have call successors, (0), 0 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:24:22,311 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 373.0) internal successors, (8952), 24 states have internal predecessors, (8952), 0 states have call successors, (0), 0 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:24:22,312 INFO L175 Difference]: Start difference. First operand has 68 places, 92 transitions, 794 flow. Second operand 23 states and 3229 transitions. [2023-11-17 16:24:22,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 319 transitions, 3038 flow [2023-11-17 16:24:22,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 319 transitions, 2911 flow, removed 32 selfloop flow, removed 5 redundant places. [2023-11-17 16:24:22,367 INFO L231 Difference]: Finished difference. Result has 91 places, 192 transitions, 2073 flow [2023-11-17 16:24:22,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2073, PETRI_PLACES=91, PETRI_TRANSITIONS=192} [2023-11-17 16:24:22,368 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2023-11-17 16:24:22,368 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 192 transitions, 2073 flow [2023-11-17 16:24:22,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 134.78571428571428) internal successors, (1887), 14 states have internal predecessors, (1887), 0 states have call successors, (0), 0 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:24:22,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:22,369 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] [2023-11-17 16:24:22,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-17 16:24:22,578 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,SelfDestructingSolverStorable9 [2023-11-17 16:24:22,578 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:24:22,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2062953221, now seen corresponding path program 6 times [2023-11-17 16:24:22,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:22,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973255013] [2023-11-17 16:24:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973255013] [2023-11-17 16:24:22,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973255013] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:22,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854718141] [2023-11-17 16:24:22,722 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:24:22,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:22,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:22,723 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:24:22,747 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:24:22,848 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 16:24:22,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:22,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 16:24:22,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:22,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854718141] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:23,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:24:23,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17 [2023-11-17 16:24:23,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404282557] [2023-11-17 16:24:23,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:24:23,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 16:24:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:23,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 16:24:23,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-11-17 16:24:23,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 373 [2023-11-17 16:24:23,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 192 transitions, 2073 flow. Second operand has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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:24:23,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:23,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 373 [2023-11-17 16:24:23,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:23,526 INFO L124 PetriNetUnfolderBase]: 2080/2860 cut-off events. [2023-11-17 16:24:23,526 INFO L125 PetriNetUnfolderBase]: For 11321/11321 co-relation queries the response was YES. [2023-11-17 16:24:23,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14737 conditions, 2860 events. 2080/2860 cut-off events. For 11321/11321 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11148 event pairs, 357 based on Foata normal form. 14/2874 useless extension candidates. Maximal degree in co-relation 14687. Up to 1480 conditions per place. [2023-11-17 16:24:23,549 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 192 selfloop transitions, 81 changer transitions 0/273 dead transitions. [2023-11-17 16:24:23,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 273 transitions, 3085 flow [2023-11-17 16:24:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:24:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:24:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1480 transitions. [2023-11-17 16:24:23,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967828418230563 [2023-11-17 16:24:23,554 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1480 transitions. [2023-11-17 16:24:23,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1480 transitions. [2023-11-17 16:24:23,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:23,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1480 transitions. [2023-11-17 16:24:23,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 148.0) internal successors, (1480), 10 states have internal predecessors, (1480), 0 states have call successors, (0), 0 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:24:23,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 373.0) internal successors, (4103), 11 states have internal predecessors, (4103), 0 states have call successors, (0), 0 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:24:23,562 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 373.0) internal successors, (4103), 11 states have internal predecessors, (4103), 0 states have call successors, (0), 0 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:24:23,562 INFO L175 Difference]: Start difference. First operand has 91 places, 192 transitions, 2073 flow. Second operand 10 states and 1480 transitions. [2023-11-17 16:24:23,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 273 transitions, 3085 flow [2023-11-17 16:24:23,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 273 transitions, 2994 flow, removed 42 selfloop flow, removed 4 redundant places. [2023-11-17 16:24:23,648 INFO L231 Difference]: Finished difference. Result has 95 places, 191 transitions, 2134 flow [2023-11-17 16:24:23,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=1972, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2134, PETRI_PLACES=95, PETRI_TRANSITIONS=191} [2023-11-17 16:24:23,649 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 63 predicate places. [2023-11-17 16:24:23,649 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 191 transitions, 2134 flow [2023-11-17 16:24:23,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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:24:23,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:23,650 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] [2023-11-17 16:24:23,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 16:24:23,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:23,856 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:24:23,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:23,856 INFO L85 PathProgramCache]: Analyzing trace with hash 564160127, now seen corresponding path program 7 times [2023-11-17 16:24:23,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:23,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431603114] [2023-11-17 16:24:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:23,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431603114] [2023-11-17 16:24:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431603114] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710620126] [2023-11-17 16:24:24,000 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:24:24,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:24,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:24,001 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:24:24,021 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:24:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:24,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 16:24:24,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:24,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:24,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710620126] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:24,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:24:24,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17 [2023-11-17 16:24:24,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380294700] [2023-11-17 16:24:24,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:24:24,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 16:24:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 16:24:24,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-11-17 16:24:24,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 373 [2023-11-17 16:24:24,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 191 transitions, 2134 flow. Second operand has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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:24:24,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:24,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 373 [2023-11-17 16:24:24,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:24,765 INFO L124 PetriNetUnfolderBase]: 2058/2820 cut-off events. [2023-11-17 16:24:24,766 INFO L125 PetriNetUnfolderBase]: For 12390/12390 co-relation queries the response was YES. [2023-11-17 16:24:24,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15017 conditions, 2820 events. 2058/2820 cut-off events. For 12390/12390 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10913 event pairs, 303 based on Foata normal form. 14/2834 useless extension candidates. Maximal degree in co-relation 14967. Up to 1134 conditions per place. [2023-11-17 16:24:24,785 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 129 selfloop transitions, 114 changer transitions 0/243 dead transitions. [2023-11-17 16:24:24,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 243 transitions, 2860 flow [2023-11-17 16:24:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:24:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 16:24:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1332 transitions. [2023-11-17 16:24:24,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967828418230563 [2023-11-17 16:24:24,789 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1332 transitions. [2023-11-17 16:24:24,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1332 transitions. [2023-11-17 16:24:24,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:24,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1332 transitions. [2023-11-17 16:24:24,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 148.0) internal successors, (1332), 9 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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:24:24,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 373.0) internal successors, (3730), 10 states have internal predecessors, (3730), 0 states have call successors, (0), 0 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:24:24,796 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 373.0) internal successors, (3730), 10 states have internal predecessors, (3730), 0 states have call successors, (0), 0 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:24:24,796 INFO L175 Difference]: Start difference. First operand has 95 places, 191 transitions, 2134 flow. Second operand 9 states and 1332 transitions. [2023-11-17 16:24:24,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 243 transitions, 2860 flow [2023-11-17 16:24:24,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 243 transitions, 2822 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-17 16:24:24,868 INFO L231 Difference]: Finished difference. Result has 97 places, 187 transitions, 2281 flow [2023-11-17 16:24:24,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2281, PETRI_PLACES=97, PETRI_TRANSITIONS=187} [2023-11-17 16:24:24,869 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 65 predicate places. [2023-11-17 16:24:24,870 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 187 transitions, 2281 flow [2023-11-17 16:24:24,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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:24:24,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:24,870 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] [2023-11-17 16:24:24,877 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:24:25,076 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,SelfDestructingSolverStorable11 [2023-11-17 16:24:25,076 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:24:25,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:25,077 INFO L85 PathProgramCache]: Analyzing trace with hash 329271091, now seen corresponding path program 1 times [2023-11-17 16:24:25,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:25,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415114338] [2023-11-17 16:24:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:24:25,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:25,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415114338] [2023-11-17 16:24:25,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415114338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:24:25,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:24:25,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:24:25,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159950452] [2023-11-17 16:24:25,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:24:25,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:24:25,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:25,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:24:25,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:24:25,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 373 [2023-11-17 16:24:25,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 187 transitions, 2281 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 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:24:25,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:25,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 373 [2023-11-17 16:24:25,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:25,534 INFO L124 PetriNetUnfolderBase]: 2170/2998 cut-off events. [2023-11-17 16:24:25,534 INFO L125 PetriNetUnfolderBase]: For 18656/18656 co-relation queries the response was YES. [2023-11-17 16:24:25,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16730 conditions, 2998 events. 2170/2998 cut-off events. For 18656/18656 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12031 event pairs, 556 based on Foata normal form. 66/3064 useless extension candidates. Maximal degree in co-relation 16679. Up to 1883 conditions per place. [2023-11-17 16:24:25,555 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 276 selfloop transitions, 3 changer transitions 0/279 dead transitions. [2023-11-17 16:24:25,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 279 transitions, 4001 flow [2023-11-17 16:24:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:24:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:24:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2023-11-17 16:24:25,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49508489722966936 [2023-11-17 16:24:25,557 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 554 transitions. [2023-11-17 16:24:25,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 554 transitions. [2023-11-17 16:24:25,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:25,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 554 transitions. [2023-11-17 16:24:25,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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:24:25,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 373.0) internal successors, (1492), 4 states have internal predecessors, (1492), 0 states have call successors, (0), 0 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:24:25,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 373.0) internal successors, (1492), 4 states have internal predecessors, (1492), 0 states have call successors, (0), 0 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:24:25,560 INFO L175 Difference]: Start difference. First operand has 97 places, 187 transitions, 2281 flow. Second operand 3 states and 554 transitions. [2023-11-17 16:24:25,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 279 transitions, 4001 flow [2023-11-17 16:24:25,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 279 transitions, 3875 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-17 16:24:25,632 INFO L231 Difference]: Finished difference. Result has 95 places, 187 transitions, 2206 flow [2023-11-17 16:24:25,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=2188, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2206, PETRI_PLACES=95, PETRI_TRANSITIONS=187} [2023-11-17 16:24:25,633 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 63 predicate places. [2023-11-17 16:24:25,633 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 187 transitions, 2206 flow [2023-11-17 16:24:25,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 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:24:25,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:25,634 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:24:25,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 16:24:25,634 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:24:25,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:25,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1566334411, now seen corresponding path program 1 times [2023-11-17 16:24:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:25,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354372517] [2023-11-17 16:24:25,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:25,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:27,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:27,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354372517] [2023-11-17 16:24:27,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354372517] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:27,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202503115] [2023-11-17 16:24:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:27,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:27,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:27,289 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:24:27,297 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:24:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:27,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-17 16:24:27,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:27,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:27,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2023-11-17 16:24:27,972 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:24:27,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:28,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:28,569 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 71 treesize of output 73 [2023-11-17 16:24:28,639 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-17 16:24:28,640 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 43 treesize of output 1 [2023-11-17 16:24:28,959 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:24:28,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202503115] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:28,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:28,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 32 [2023-11-17 16:24:28,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025872258] [2023-11-17 16:24:28,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:28,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 16:24:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:28,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 16:24:28,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2023-11-17 16:24:28,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 373 [2023-11-17 16:24:28,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 187 transitions, 2206 flow. Second operand has 33 states, 33 states have (on average 100.24242424242425) internal successors, (3308), 33 states have internal predecessors, (3308), 0 states have call successors, (0), 0 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:24:28,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:28,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 373 [2023-11-17 16:24:28,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:35,916 INFO L124 PetriNetUnfolderBase]: 8390/11502 cut-off events. [2023-11-17 16:24:35,917 INFO L125 PetriNetUnfolderBase]: For 66166/66166 co-relation queries the response was YES. [2023-11-17 16:24:35,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62816 conditions, 11502 events. 8390/11502 cut-off events. For 66166/66166 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 54637 event pairs, 265 based on Foata normal form. 10/11512 useless extension candidates. Maximal degree in co-relation 62766. Up to 4953 conditions per place. [2023-11-17 16:24:36,014 INFO L140 encePairwiseOnDemand]: 355/373 looper letters, 742 selfloop transitions, 743 changer transitions 8/1493 dead transitions. [2023-11-17 16:24:36,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 1493 transitions, 18050 flow [2023-11-17 16:24:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-17 16:24:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2023-11-17 16:24:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 6960 transitions. [2023-11-17 16:24:36,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2915549597855228 [2023-11-17 16:24:36,027 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 6960 transitions. [2023-11-17 16:24:36,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 6960 transitions. [2023-11-17 16:24:36,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:36,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 6960 transitions. [2023-11-17 16:24:36,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 108.75) internal successors, (6960), 64 states have internal predecessors, (6960), 0 states have call successors, (0), 0 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:24:36,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 373.0) internal successors, (24245), 65 states have internal predecessors, (24245), 0 states have call successors, (0), 0 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:24:36,076 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 373.0) internal successors, (24245), 65 states have internal predecessors, (24245), 0 states have call successors, (0), 0 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:24:36,076 INFO L175 Difference]: Start difference. First operand has 95 places, 187 transitions, 2206 flow. Second operand 64 states and 6960 transitions. [2023-11-17 16:24:36,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 1493 transitions, 18050 flow [2023-11-17 16:24:36,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 1493 transitions, 18041 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:24:36,475 INFO L231 Difference]: Finished difference. Result has 204 places, 889 transitions, 14057 flow [2023-11-17 16:24:36,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=14057, PETRI_PLACES=204, PETRI_TRANSITIONS=889} [2023-11-17 16:24:36,475 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 172 predicate places. [2023-11-17 16:24:36,475 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 889 transitions, 14057 flow [2023-11-17 16:24:36,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 100.24242424242425) internal successors, (3308), 33 states have internal predecessors, (3308), 0 states have call successors, (0), 0 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:24:36,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:36,476 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:24:36,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-17 16:24:36,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-17 16:24:36,677 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:24:36,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1483856578, now seen corresponding path program 1 times [2023-11-17 16:24:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208833573] [2023-11-17 16:24:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:24:36,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:36,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208833573] [2023-11-17 16:24:36,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208833573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:24:36,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:24:36,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:24:36,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519442910] [2023-11-17 16:24:36,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:24:36,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:24:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:36,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:24:36,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:24:36,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 373 [2023-11-17 16:24:36,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 889 transitions, 14057 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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:24:36,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:36,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 373 [2023-11-17 16:24:36,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:38,914 INFO L124 PetriNetUnfolderBase]: 6691/9306 cut-off events. [2023-11-17 16:24:38,914 INFO L125 PetriNetUnfolderBase]: For 139414/139414 co-relation queries the response was YES. [2023-11-17 16:24:38,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67967 conditions, 9306 events. 6691/9306 cut-off events. For 139414/139414 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 43365 event pairs, 1643 based on Foata normal form. 274/9580 useless extension candidates. Maximal degree in co-relation 67866. Up to 4832 conditions per place. [2023-11-17 16:24:39,005 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 696 selfloop transitions, 85 changer transitions 0/781 dead transitions. [2023-11-17 16:24:39,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 781 transitions, 13509 flow [2023-11-17 16:24:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:24:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:24:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2023-11-17 16:24:39,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49955317247542447 [2023-11-17 16:24:39,007 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 559 transitions. [2023-11-17 16:24:39,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions. [2023-11-17 16:24:39,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:39,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions. [2023-11-17 16:24:39,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:24:39,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 373.0) internal successors, (1492), 4 states have internal predecessors, (1492), 0 states have call successors, (0), 0 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:24:39,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 373.0) internal successors, (1492), 4 states have internal predecessors, (1492), 0 states have call successors, (0), 0 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:24:39,010 INFO L175 Difference]: Start difference. First operand has 204 places, 889 transitions, 14057 flow. Second operand 3 states and 559 transitions. [2023-11-17 16:24:39,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 781 transitions, 13509 flow [2023-11-17 16:24:39,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 781 transitions, 12326 flow, removed 543 selfloop flow, removed 7 redundant places. [2023-11-17 16:24:39,721 INFO L231 Difference]: Finished difference. Result has 197 places, 723 transitions, 10364 flow [2023-11-17 16:24:39,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=10194, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=10364, PETRI_PLACES=197, PETRI_TRANSITIONS=723} [2023-11-17 16:24:39,721 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 165 predicate places. [2023-11-17 16:24:39,721 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 723 transitions, 10364 flow [2023-11-17 16:24:39,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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:24:39,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:39,722 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:24:39,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 16:24:39,722 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:24:39,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:39,723 INFO L85 PathProgramCache]: Analyzing trace with hash 656958209, now seen corresponding path program 2 times [2023-11-17 16:24:39,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:39,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381104878] [2023-11-17 16:24:39,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:39,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:41,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:41,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381104878] [2023-11-17 16:24:41,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381104878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:41,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478448162] [2023-11-17 16:24:41,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:24:41,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:41,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:41,765 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:24:41,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-17 16:24:41,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:24:41,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:41,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-17 16:24:41,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:42,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:24:42,074 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:24:42,197 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:24:42,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:24:42,394 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 42 treesize of output 31 [2023-11-17 16:24:42,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:24:42,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:42,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 56 [2023-11-17 16:24:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:42,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:44,580 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse0 .cse1))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (select .cse3 .cse1) (+ (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse4 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (select .cse4 .cse1) (+ (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse6 .cse1)))))))) is different from false [2023-11-17 16:24:44,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:44,590 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 107 treesize of output 71 [2023-11-17 16:24:44,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:44,598 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 483 treesize of output 443 [2023-11-17 16:24:44,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2023-11-17 16:24:44,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2023-11-17 16:24:44,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:44,619 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 95 treesize of output 71 [2023-11-17 16:24:44,648 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:24:44,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 1 [2023-11-17 16:24:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-17 16:24:44,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478448162] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:44,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:44,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 38 [2023-11-17 16:24:44,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278285592] [2023-11-17 16:24:44,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:44,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-17 16:24:44,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:44,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-17 16:24:44,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1280, Unknown=14, NotChecked=74, Total=1560 [2023-11-17 16:24:44,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 373 [2023-11-17 16:24:44,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 723 transitions, 10364 flow. Second operand has 40 states, 40 states have (on average 99.875) internal successors, (3995), 40 states have internal predecessors, (3995), 0 states have call successors, (0), 0 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:24:44,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:44,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 373 [2023-11-17 16:24:44,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:49,164 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse32 (mod c_~sorted1~0 256)) (.cse4 (= (mod c_~sorted3~0 256) 0)) (.cse20 (= (mod c_~sorted2~0 256) 0))) (let ((.cse31 (* 4 c_~M~0)) (.cse27 (not .cse20)) (.cse12 (< c_~N~0 (+ 2 c_~M~0))) (.cse17 (not .cse4)) (.cse11 (= .cse32 0))) (let ((.cse13 (or .cse12 .cse17 .cse11)) (.cse5 (and .cse11 .cse20)) (.cse6 (and .cse27 (= .cse32 1))) (.cse3 (< 0 c_~M~0)) (.cse9 (+ c_~A~0.offset .cse31)) (.cse8 (+ c_~A~0.offset .cse31 4))) (and (= c_~sorted2~0 1) (let ((.cse1 (= c_~sorted3~0 1)) (.cse2 (= 1 c_~sorted1~0))) (or (let ((.cse0 (not (= 0 c_~M~0)))) (and (or (= c_~sorted3~0 0) (and .cse0 .cse1)) (or (= 0 c_~sorted1~0) (and .cse0 .cse2)))) (and .cse1 .cse2))) (<= 0 c_~M~0) (or .cse3 (and (or .cse4 (and (or .cse5 .cse6 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse7 .cse8) (+ (select .cse7 .cse9) 1))))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse10 .cse9) (select .cse10 .cse8)))) .cse11)) .cse12) .cse13)) (or .cse3 (and .cse13 (or .cse4 .cse12 (let ((.cse16 (select |c_#memory_int| c_~A~0.base))) (let ((.cse15 (select .cse16 .cse8)) (.cse14 (select .cse16 .cse9))) (and (or .cse11 (< .cse14 .cse15)) (or .cse5 .cse6 (< .cse15 (+ .cse14 1))))))))) (or .cse3 .cse11 (let ((.cse19 (+ c_~A~0.offset 4))) (and (or .cse12 .cse17 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse18 .cse19) (+ (select .cse18 c_~A~0.offset) 1))))) (or .cse4 .cse12 .cse20 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse21 (select .cse22 c_~A~0.base))) (< (select .cse21 c_~A~0.offset) (select .cse21 .cse19))) (let ((.cse23 (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse23 .cse8) (+ (select .cse23 .cse9) 1))))))) (or .cse12 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse24 (select .cse25 c_~A~0.base))) (< (select .cse24 .cse19) (+ (select .cse24 c_~A~0.offset) 1))) (let ((.cse26 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse26 .cse8) (+ (select .cse26 .cse9) 1)))))) .cse27) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse28 (select .cse29 c_~A~0.base))) (< (select .cse28 .cse19) (+ (select .cse28 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse30 (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse30 .cse9) (select .cse30 .cse8)))))))))))))))) is different from false [2023-11-17 16:24:51,447 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse39 (* 4 c_~M~0)) (.cse4 (= (mod c_~sorted2~0 256) 0)) (.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse2 (mod c_~sorted1~0 256)) (.cse40 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse15 (+ c_~A~0.offset .cse40)) (.cse16 (+ c_~A~0.offset .cse40 4)) (.cse17 (< 0 c_~M~0)) (.cse5 (= .cse2 0)) (.cse1 (not .cse3)) (.cse6 (< c_~N~0 (+ 2 c_~M~0))) (.cse0 (not .cse4)) (.cse11 (+ c_~A~0.offset .cse39)) (.cse12 (+ c_~A~0.offset .cse39 4))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0) (and .cse0 .cse1 (= .cse2 1)) (and (or .cse3 .cse4) .cse5)) (or (let ((.cse14 (select |c_#memory_int| c_~A~0.base))) (let ((.cse9 (select .cse14 .cse16)) (.cse8 (select .cse14 .cse15)) (.cse7 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse13 .cse12) (+ (select .cse13 .cse11) 1)))))) (and (or .cse3 .cse6 .cse7 (< .cse8 .cse9) .cse4) (or (< .cse9 (+ .cse8 1)) (and (or .cse6 (and (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse10 .cse11) (select .cse10 .cse12)))) (or .cse7 .cse0))) (or .cse6 .cse1)))))) .cse17 .cse5) (or (and (or .cse6 .cse1 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse18 .cse16) (+ (select .cse18 .cse15) 1))))) (or .cse6 (and (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse19 (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse19 .cse11) (select .cse19 .cse12)))) (let ((.cse21 (select .cse20 c_~A~0.base))) (< (select .cse21 .cse16) (+ (select .cse21 .cse15) 1)))))) (or .cse0 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse22 (select .cse23 c_~A~0.base))) (< (select .cse22 .cse16) (+ (select .cse22 .cse15) 1))) (let ((.cse24 (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse24 .cse12) (+ (select .cse24 .cse11) 1))))))))) (or .cse3 .cse6 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse25 (select .cse26 c_~A~0.base))) (< (select .cse25 .cse15) (select .cse25 .cse16))) (let ((.cse27 (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse27 .cse12) (+ (select .cse27 .cse11) 1)))))) .cse4)) .cse17 .cse5) (or .cse17 .cse5 (let ((.cse29 (+ c_~A~0.offset 4))) (and (or .cse6 .cse1 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse28 .cse29) (+ (select .cse28 c_~A~0.offset) 1))))) (or .cse3 .cse6 .cse4 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse30 (select .cse31 c_~A~0.base))) (< (select .cse30 c_~A~0.offset) (select .cse30 .cse29))) (let ((.cse32 (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse32 .cse12) (+ (select .cse32 .cse11) 1))))))) (or .cse6 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse33 (select .cse34 c_~A~0.base))) (< (select .cse33 .cse29) (+ (select .cse33 c_~A~0.offset) 1))) (let ((.cse35 (select (store .cse34 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse35 .cse12) (+ (select .cse35 .cse11) 1)))))) .cse0) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse36 (select .cse37 c_~A~0.base))) (< (select .cse36 .cse29) (+ (select .cse36 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse38 (select (store .cse37 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse38 .cse11) (select .cse38 .cse12))))))))))))))) is different from false [2023-11-17 16:24:55,452 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse56 (* 4 c_~M~0)) (.cse52 (mod c_~sorted1~0 256)) (.cse0 (= (mod c_~sorted3~0 256) 0)) (.cse5 (= (mod c_~sorted2~0 256) 0))) (let ((.cse7 (not .cse5)) (.cse1 (< c_~N~0 (+ 2 c_~M~0))) (.cse8 (not .cse0)) (.cse13 (= .cse52 0)) (.cse53 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse26 (+ c_~A~0.offset .cse56 4)) (.cse25 (+ c_~A~0.offset .cse56))) (let ((.cse2 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse55 .cse26) (+ (select .cse55 .cse25) 1))))) (.cse6 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse54 .cse25) (select .cse54 .cse26))))) (.cse16 (= 1 c_~sorted1~0)) (.cse10 (+ c_~A~0.offset .cse53)) (.cse11 (+ c_~A~0.offset .cse53 4)) (.cse19 (or .cse1 .cse8 .cse13)) (.cse17 (and .cse13 .cse5)) (.cse18 (and .cse7 (= .cse52 1))) (.cse9 (select |c_#memory_int| c_~A~0.base)) (.cse12 (< 0 c_~M~0))) (and (= c_~sorted2~0 1) (<= c_thread2Thread1of1ForFork0_~i~1 0) (or (let ((.cse4 (select .cse9 .cse11)) (.cse3 (select .cse9 .cse10))) (and (or .cse0 .cse1 .cse2 (< .cse3 .cse4) .cse5) (or (< .cse4 (+ .cse3 1)) (and (or .cse1 (and .cse6 (or .cse2 .cse7))) (or .cse1 .cse8))))) .cse12 .cse13) (let ((.cse15 (= c_~sorted3~0 1))) (or (let ((.cse14 (not (= 0 c_~M~0)))) (and (or (= c_~sorted3~0 0) (and .cse14 .cse15)) (or (= 0 c_~sorted1~0) (and .cse14 .cse16)))) (and .cse15 .cse16))) (<= 0 c_~M~0) (or .cse12 (and (or .cse0 (and (or .cse17 .cse18 .cse2) (or .cse6 .cse13)) .cse1) .cse19)) (or (let ((.cse21 (div c_~sorted1~0 256))) (and (let ((.cse22 (div c_~sorted3~0 256))) (or (let ((.cse20 (= c_~sorted3~0 (* 256 .cse22)))) (and (or (< 0 c_~sorted1~0) .cse20) (or (< c_~sorted1~0 1) (and (not .cse20) .cse16)) (= .cse21 0))) (and (= (+ (* .cse21 256) 1) c_~sorted1~0) (<= .cse22 0) (<= 1 c_~sorted3~0)))) (<= .cse21 0))) (and (<= 1 c_~M~0) (= c_thread2Thread1of1ForFork0_~i~1 0))) (or (and (or .cse1 .cse8 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse23 .cse11) (+ (select .cse23 .cse10) 1))))) (or .cse1 (and (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse24 (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse24 .cse25) (select .cse24 .cse26)))) (let ((.cse28 (select .cse27 c_~A~0.base))) (< (select .cse28 .cse11) (+ (select .cse28 .cse10) 1)))))) (or .cse7 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse29 (select .cse30 c_~A~0.base))) (< (select .cse29 .cse11) (+ (select .cse29 .cse10) 1))) (let ((.cse31 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse31 .cse26) (+ (select .cse31 .cse25) 1))))))))) (or .cse0 .cse1 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse32 (select .cse33 c_~A~0.base))) (< (select .cse32 .cse10) (select .cse32 .cse11))) (let ((.cse34 (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse34 .cse26) (+ (select .cse34 .cse25) 1)))))) .cse5)) .cse12 .cse13) (or .cse12 (let ((.cse38 (< c_~N~0 (+ 2 c_thread3Thread1of1ForFork1_~i~2)))) (and (or .cse0 (let ((.cse37 (* c_thread3Thread1of1ForFork1_~i~2 4))) (let ((.cse36 (select .cse9 (+ c_~A~0.offset .cse37))) (.cse35 (select .cse9 (+ c_~A~0.offset 4 .cse37)))) (and (or .cse17 .cse18 (< .cse35 (+ .cse36 1))) (or .cse13 (< .cse36 .cse35))))) .cse38) (or .cse38 .cse8 .cse13)))) (or .cse12 (and .cse19 (or .cse0 .cse1 (let ((.cse40 (select .cse9 .cse26)) (.cse39 (select .cse9 .cse25))) (and (or .cse13 (< .cse39 .cse40)) (or .cse17 .cse18 (< .cse40 (+ .cse39 1)))))))) (or .cse12 .cse13 (let ((.cse42 (+ c_~A~0.offset 4))) (and (or .cse1 .cse8 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse41 .cse42) (+ (select .cse41 c_~A~0.offset) 1))))) (or .cse0 .cse1 .cse5 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse43 (select .cse44 c_~A~0.base))) (< (select .cse43 c_~A~0.offset) (select .cse43 .cse42))) (let ((.cse45 (select (store .cse44 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse45 .cse26) (+ (select .cse45 .cse25) 1))))))) (or .cse1 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse46 (select .cse47 c_~A~0.base))) (< (select .cse46 .cse42) (+ (select .cse46 c_~A~0.offset) 1))) (let ((.cse48 (select (store .cse47 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse48 .cse26) (+ (select .cse48 .cse25) 1)))))) .cse7) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse49 (select .cse50 c_~A~0.base))) (< (select .cse49 .cse42) (+ (select .cse49 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse51 (select (store .cse50 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse51 .cse25) (select .cse51 .cse26)))))))))))))))) is different from false [2023-11-17 16:24:55,791 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= (mod c_~sorted2~0 256) 0)) (.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse2 (mod c_~sorted1~0 256))) (let ((.cse5 (= .cse2 0)) (.cse1 (not .cse3)) (.cse0 (not .cse4))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0) (and .cse0 .cse1 (= .cse2 1)) (and (or .cse3 .cse4) .cse5)) (or (< 0 c_~M~0) .cse5 (let ((.cse20 (* 4 c_~M~0))) (let ((.cse6 (< c_~N~0 (+ 2 c_~M~0))) (.cse8 (+ c_~A~0.offset 4)) (.cse13 (+ c_~A~0.offset .cse20)) (.cse12 (+ c_~A~0.offset .cse20 4))) (and (or .cse6 .cse1 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse7 .cse8) (+ (select .cse7 c_~A~0.offset) 1))))) (or .cse3 .cse6 .cse4 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse9 (select .cse10 c_~A~0.base))) (< (select .cse9 c_~A~0.offset) (select .cse9 .cse8))) (let ((.cse11 (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse11 .cse12) (+ (select .cse11 .cse13) 1))))))) (or .cse6 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse14 (select .cse15 c_~A~0.base))) (< (select .cse14 .cse8) (+ (select .cse14 c_~A~0.offset) 1))) (let ((.cse16 (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse16 .cse12) (+ (select .cse16 .cse13) 1)))))) .cse0) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse17 (select .cse18 c_~A~0.base))) (< (select .cse17 .cse8) (+ (select .cse17 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse19 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse19 .cse13) (select .cse19 .cse12)))))))))))))))) is different from false [2023-11-17 16:24:59,197 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse35 (mod c_~sorted1~0 256)) (.cse7 (= (mod c_~sorted3~0 256) 0)) (.cse23 (= (mod c_~sorted2~0 256) 0))) (let ((.cse34 (* 4 c_~M~0)) (.cse30 (not .cse23)) (.cse15 (< c_~N~0 (+ 2 c_~M~0))) (.cse20 (not .cse7)) (.cse14 (= .cse35 0)) (.cse2 (= c_~sorted3~0 1)) (.cse4 (= 1 c_~sorted1~0))) (let ((.cse3 (= 0 c_~sorted1~0)) (.cse0 (= c_~sorted3~0 0)) (.cse5 (and .cse2 .cse4)) (.cse16 (or .cse15 .cse20 .cse14)) (.cse8 (and .cse14 .cse23)) (.cse9 (and .cse30 (= .cse35 1))) (.cse6 (< 0 c_~M~0)) (.cse12 (+ c_~A~0.offset .cse34)) (.cse11 (+ c_~A~0.offset .cse34 4))) (and (= c_~sorted2~0 1) (or (let ((.cse1 (not (= 0 c_~M~0)))) (and (or .cse0 (and .cse1 .cse2)) (or .cse3 (and .cse1 .cse4)))) .cse5) (<= 0 c_~M~0) (or (and .cse3 .cse0) .cse5) (or .cse6 (and (or .cse7 (and (or .cse8 .cse9 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse10 .cse11) (+ (select .cse10 .cse12) 1))))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse13 .cse12) (select .cse13 .cse11)))) .cse14)) .cse15) .cse16)) (or .cse6 (and .cse16 (or .cse7 .cse15 (let ((.cse19 (select |c_#memory_int| c_~A~0.base))) (let ((.cse18 (select .cse19 .cse11)) (.cse17 (select .cse19 .cse12))) (and (or .cse14 (< .cse17 .cse18)) (or .cse8 .cse9 (< .cse18 (+ .cse17 1))))))))) (or .cse6 .cse14 (let ((.cse22 (+ c_~A~0.offset 4))) (and (or .cse15 .cse20 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse21 .cse22) (+ (select .cse21 c_~A~0.offset) 1))))) (or .cse7 .cse15 .cse23 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse24 (select .cse25 c_~A~0.base))) (< (select .cse24 c_~A~0.offset) (select .cse24 .cse22))) (let ((.cse26 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse26 .cse11) (+ (select .cse26 .cse12) 1))))))) (or .cse15 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse27 (select .cse28 c_~A~0.base))) (< (select .cse27 .cse22) (+ (select .cse27 c_~A~0.offset) 1))) (let ((.cse29 (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse29 .cse11) (+ (select .cse29 .cse12) 1)))))) .cse30) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse31 (select .cse32 c_~A~0.base))) (< (select .cse31 .cse22) (+ (select .cse31 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse33 (select (store .cse32 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse33 .cse12) (select .cse33 .cse11)))))))))))))))) is different from false [2023-11-17 16:25:01,376 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse35 (mod c_~sorted1~0 256)) (.cse4 (= (mod c_~sorted3~0 256) 0)) (.cse23 (= (mod c_~sorted2~0 256) 0))) (let ((.cse34 (* 4 c_~M~0)) (.cse30 (not .cse23)) (.cse12 (< c_~N~0 (+ 2 c_~M~0))) (.cse20 (not .cse4)) (.cse11 (= .cse35 0))) (let ((.cse2 (= 1 c_~sorted1~0)) (.cse13 (or .cse12 .cse20 .cse11)) (.cse5 (and .cse11 .cse23)) (.cse6 (and .cse30 (= .cse35 1))) (.cse3 (< 0 c_~M~0)) (.cse9 (+ c_~A~0.offset .cse34)) (.cse8 (+ c_~A~0.offset .cse34 4))) (and (= c_~sorted2~0 1) (<= c_thread2Thread1of1ForFork0_~i~1 0) (let ((.cse1 (= c_~sorted3~0 1))) (or (let ((.cse0 (not (= 0 c_~M~0)))) (and (or (= c_~sorted3~0 0) (and .cse0 .cse1)) (or (= 0 c_~sorted1~0) (and .cse0 .cse2)))) (and .cse1 .cse2))) (<= 0 c_~M~0) (or .cse3 (and (or .cse4 (and (or .cse5 .cse6 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse7 .cse8) (+ (select .cse7 .cse9) 1))))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse10 .cse9) (select .cse10 .cse8)))) .cse11)) .cse12) .cse13)) (or (let ((.cse15 (div c_~sorted1~0 256))) (and (let ((.cse16 (div c_~sorted3~0 256))) (or (let ((.cse14 (= c_~sorted3~0 (* 256 .cse16)))) (and (or (< 0 c_~sorted1~0) .cse14) (or (< c_~sorted1~0 1) (and (not .cse14) .cse2)) (= .cse15 0))) (and (= (+ (* .cse15 256) 1) c_~sorted1~0) (<= .cse16 0) (<= 1 c_~sorted3~0)))) (<= .cse15 0))) (and (<= 1 c_~M~0) (= c_thread2Thread1of1ForFork0_~i~1 0))) (or .cse3 (and .cse13 (or .cse4 .cse12 (let ((.cse19 (select |c_#memory_int| c_~A~0.base))) (let ((.cse18 (select .cse19 .cse8)) (.cse17 (select .cse19 .cse9))) (and (or .cse11 (< .cse17 .cse18)) (or .cse5 .cse6 (< .cse18 (+ .cse17 1))))))))) (or .cse3 .cse11 (let ((.cse22 (+ c_~A~0.offset 4))) (and (or .cse12 .cse20 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse21 .cse22) (+ (select .cse21 c_~A~0.offset) 1))))) (or .cse4 .cse12 .cse23 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse24 (select .cse25 c_~A~0.base))) (< (select .cse24 c_~A~0.offset) (select .cse24 .cse22))) (let ((.cse26 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse26 .cse8) (+ (select .cse26 .cse9) 1))))))) (or .cse12 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse27 (select .cse28 c_~A~0.base))) (< (select .cse27 .cse22) (+ (select .cse27 c_~A~0.offset) 1))) (let ((.cse29 (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse29 .cse8) (+ (select .cse29 .cse9) 1)))))) .cse30) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse31 (select .cse32 c_~A~0.base))) (< (select .cse31 .cse22) (+ (select .cse31 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse33 (select (store .cse32 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse33 .cse9) (select .cse33 .cse8)))))))))))))))) is different from false [2023-11-17 16:25:06,032 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse49 (* 4 c_~M~0)) (.cse45 (mod c_~sorted1~0 256)) (.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse8 (= (mod c_~sorted2~0 256) 0))) (let ((.cse10 (not .cse8)) (.cse4 (< c_~N~0 (+ 2 c_~M~0))) (.cse11 (not .cse3)) (.cse16 (= .cse45 0)) (.cse46 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse23 (+ c_~A~0.offset .cse49 4)) (.cse22 (+ c_~A~0.offset .cse49))) (let ((.cse1 (div c_~sorted1~0 256)) (.cse5 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse48 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse48 .cse23) (+ (select .cse48 .cse22) 1))))) (.cse9 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse47 .cse22) (select .cse47 .cse23))))) (.cse13 (+ c_~A~0.offset .cse46)) (.cse14 (+ c_~A~0.offset .cse46 4)) (.cse19 (or .cse4 .cse11 .cse16)) (.cse17 (and .cse16 .cse8)) (.cse18 (and .cse10 (= .cse45 1))) (.cse12 (select |c_#memory_int| c_~A~0.base)) (.cse15 (< 0 c_~M~0))) (and (let ((.cse2 (div c_~sorted3~0 256))) (or (let ((.cse0 (= c_~sorted3~0 (* 256 .cse2)))) (and (or (< 0 c_~sorted1~0) .cse0) (or (< c_~sorted1~0 1) (and (not .cse0) (= 1 c_~sorted1~0))) (= .cse1 0))) (and (= (+ (* .cse1 256) 1) c_~sorted1~0) (<= .cse2 0) (<= 1 c_~sorted3~0)))) (= c_~sorted2~0 1) (<= .cse1 0) (or (let ((.cse7 (select .cse12 .cse14)) (.cse6 (select .cse12 .cse13))) (and (or .cse3 .cse4 .cse5 (< .cse6 .cse7) .cse8) (or (< .cse7 (+ .cse6 1)) (and (or .cse4 (and .cse9 (or .cse5 .cse10))) (or .cse4 .cse11))))) .cse15 .cse16) (or .cse15 (and (or .cse3 (and (or .cse17 .cse18 .cse5) (or .cse9 .cse16)) .cse4) .cse19)) (or (and (or .cse4 .cse11 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse20 .cse14) (+ (select .cse20 .cse13) 1))))) (or .cse4 (and (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse21 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse21 .cse22) (select .cse21 .cse23)))) (let ((.cse25 (select .cse24 c_~A~0.base))) (< (select .cse25 .cse14) (+ (select .cse25 .cse13) 1)))))) (or .cse10 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse26 (select .cse27 c_~A~0.base))) (< (select .cse26 .cse14) (+ (select .cse26 .cse13) 1))) (let ((.cse28 (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse28 .cse23) (+ (select .cse28 .cse22) 1))))))))) (or .cse3 .cse4 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse29 (select .cse30 c_~A~0.base))) (< (select .cse29 .cse13) (select .cse29 .cse14))) (let ((.cse31 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse31 .cse23) (+ (select .cse31 .cse22) 1)))))) .cse8)) .cse15 .cse16) (or .cse15 (and .cse19 (or .cse3 .cse4 (let ((.cse33 (select .cse12 .cse23)) (.cse32 (select .cse12 .cse22))) (and (or .cse16 (< .cse32 .cse33)) (or .cse17 .cse18 (< .cse33 (+ .cse32 1)))))))) (or .cse15 .cse16 (let ((.cse35 (+ c_~A~0.offset 4))) (and (or .cse4 .cse11 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse34 .cse35) (+ (select .cse34 c_~A~0.offset) 1))))) (or .cse3 .cse4 .cse8 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse36 (select .cse37 c_~A~0.base))) (< (select .cse36 c_~A~0.offset) (select .cse36 .cse35))) (let ((.cse38 (select (store .cse37 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse38 .cse23) (+ (select .cse38 .cse22) 1))))))) (or .cse4 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse39 (select .cse40 c_~A~0.base))) (< (select .cse39 .cse35) (+ (select .cse39 c_~A~0.offset) 1))) (let ((.cse41 (select (store .cse40 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse41 .cse23) (+ (select .cse41 .cse22) 1)))))) .cse10) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse42 (select .cse43 c_~A~0.base))) (< (select .cse42 .cse35) (+ (select .cse42 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse44 (select (store .cse43 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse44 .cse22) (select .cse44 .cse23)))))))))))))))) is different from false [2023-11-17 16:25:06,615 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse53 (* 4 c_~M~0)) (.cse49 (mod c_~sorted1~0 256)) (.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse8 (= (mod c_~sorted2~0 256) 0))) (let ((.cse10 (not .cse8)) (.cse4 (< c_~N~0 (+ 2 c_~M~0))) (.cse11 (not .cse3)) (.cse16 (= .cse49 0)) (.cse50 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse23 (+ c_~A~0.offset .cse53 4)) (.cse22 (+ c_~A~0.offset .cse53))) (let ((.cse1 (div c_~sorted1~0 256)) (.cse5 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse52 .cse23) (+ (select .cse52 .cse22) 1))))) (.cse9 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse51 .cse22) (select .cse51 .cse23))))) (.cse13 (+ c_~A~0.offset .cse50)) (.cse14 (+ c_~A~0.offset .cse50 4)) (.cse19 (or .cse4 .cse11 .cse16)) (.cse17 (and .cse16 .cse8)) (.cse18 (and .cse10 (= .cse49 1))) (.cse12 (select |c_#memory_int| c_~A~0.base)) (.cse15 (< 0 c_~M~0))) (and (let ((.cse2 (div c_~sorted3~0 256))) (or (let ((.cse0 (= c_~sorted3~0 (* 256 .cse2)))) (and (or (< 0 c_~sorted1~0) .cse0) (or (< c_~sorted1~0 1) (and (not .cse0) (= 1 c_~sorted1~0))) (= .cse1 0))) (and (= (+ (* .cse1 256) 1) c_~sorted1~0) (<= .cse2 0) (<= 1 c_~sorted3~0)))) (= c_~sorted2~0 1) (<= .cse1 0) (or (let ((.cse7 (select .cse12 .cse14)) (.cse6 (select .cse12 .cse13))) (and (or .cse3 .cse4 .cse5 (< .cse6 .cse7) .cse8) (or (< .cse7 (+ .cse6 1)) (and (or .cse4 (and .cse9 (or .cse5 .cse10))) (or .cse4 .cse11))))) .cse15 .cse16) (or .cse15 (and (or .cse3 (and (or .cse17 .cse18 .cse5) (or .cse9 .cse16)) .cse4) .cse19)) (or (and (or .cse4 .cse11 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse20 .cse14) (+ (select .cse20 .cse13) 1))))) (or .cse4 (and (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse21 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse21 .cse22) (select .cse21 .cse23)))) (let ((.cse25 (select .cse24 c_~A~0.base))) (< (select .cse25 .cse14) (+ (select .cse25 .cse13) 1)))))) (or .cse10 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse26 (select .cse27 c_~A~0.base))) (< (select .cse26 .cse14) (+ (select .cse26 .cse13) 1))) (let ((.cse28 (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse28 .cse23) (+ (select .cse28 .cse22) 1))))))))) (or .cse3 .cse4 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse29 (select .cse30 c_~A~0.base))) (< (select .cse29 .cse13) (select .cse29 .cse14))) (let ((.cse31 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse31 .cse23) (+ (select .cse31 .cse22) 1)))))) .cse8)) .cse15 .cse16) (or .cse15 (let ((.cse35 (< c_~N~0 (+ 2 c_thread3Thread1of1ForFork1_~i~2)))) (and (or .cse3 (let ((.cse34 (* c_thread3Thread1of1ForFork1_~i~2 4))) (let ((.cse33 (select .cse12 (+ c_~A~0.offset .cse34))) (.cse32 (select .cse12 (+ c_~A~0.offset 4 .cse34)))) (and (or .cse17 .cse18 (< .cse32 (+ .cse33 1))) (or .cse16 (< .cse33 .cse32))))) .cse35) (or .cse35 .cse11 .cse16)))) (or .cse15 (and .cse19 (or .cse3 .cse4 (let ((.cse37 (select .cse12 .cse23)) (.cse36 (select .cse12 .cse22))) (and (or .cse16 (< .cse36 .cse37)) (or .cse17 .cse18 (< .cse37 (+ .cse36 1)))))))) (or .cse15 .cse16 (let ((.cse39 (+ c_~A~0.offset 4))) (and (or .cse4 .cse11 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse38 .cse39) (+ (select .cse38 c_~A~0.offset) 1))))) (or .cse3 .cse4 .cse8 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse40 (select .cse41 c_~A~0.base))) (< (select .cse40 c_~A~0.offset) (select .cse40 .cse39))) (let ((.cse42 (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse42 .cse23) (+ (select .cse42 .cse22) 1))))))) (or .cse4 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse43 (select .cse44 c_~A~0.base))) (< (select .cse43 .cse39) (+ (select .cse43 c_~A~0.offset) 1))) (let ((.cse45 (select (store .cse44 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse45 .cse23) (+ (select .cse45 .cse22) 1)))))) .cse10) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse46 (select .cse47 c_~A~0.base))) (< (select .cse46 .cse39) (+ (select .cse46 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse48 (select (store .cse47 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse48 .cse22) (select .cse48 .cse23)))))))))))))))) is different from false [2023-11-17 16:25:09,706 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse53 (* 4 c_~M~0)) (.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse54 (mod c_~sorted1~0 256)) (.cse4 (= (mod c_~sorted2~0 256) 0))) (let ((.cse0 (not .cse4)) (.cse2 (= .cse54 1)) (.cse6 (< c_~N~0 (+ 2 c_~M~0))) (.cse1 (not .cse3)) (.cse5 (= .cse54 0)) (.cse50 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse24 (+ c_~A~0.offset .cse53 4)) (.cse23 (+ c_~A~0.offset .cse53))) (let ((.cse7 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse52 .cse24) (+ (select .cse52 .cse23) 1))))) (.cse10 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse51 .cse23) (select .cse51 .cse24))))) (.cse12 (+ c_~A~0.offset .cse50)) (.cse13 (+ c_~A~0.offset .cse50 4)) (.cse20 (or .cse6 .cse1 .cse5)) (.cse18 (and .cse5 .cse4)) (.cse19 (and .cse0 .cse2)) (.cse11 (select |c_#memory_int| c_~A~0.base)) (.cse14 (< 0 c_~M~0))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0) (and .cse0 .cse1 .cse2) (and (or .cse3 .cse4) .cse5)) (= c_~sorted2~0 1) (or (let ((.cse9 (select .cse11 .cse13)) (.cse8 (select .cse11 .cse12))) (and (or .cse3 .cse6 .cse7 (< .cse8 .cse9) .cse4) (or (< .cse9 (+ .cse8 1)) (and (or .cse6 (and .cse10 (or .cse7 .cse0))) (or .cse6 .cse1))))) .cse14 .cse5) (let ((.cse16 (= c_~sorted3~0 1)) (.cse17 (= 1 c_~sorted1~0))) (or (let ((.cse15 (not (= 0 c_~M~0)))) (and (or (= c_~sorted3~0 0) (and .cse15 .cse16)) (or (= 0 c_~sorted1~0) (and .cse15 .cse17)))) (and .cse16 .cse17))) (<= 0 c_~M~0) (or .cse14 (and (or .cse3 (and (or .cse18 .cse19 .cse7) (or .cse10 .cse5)) .cse6) .cse20)) (or (and (or .cse6 .cse1 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse21 .cse13) (+ (select .cse21 .cse12) 1))))) (or .cse6 (and (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse22 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse22 .cse23) (select .cse22 .cse24)))) (let ((.cse26 (select .cse25 c_~A~0.base))) (< (select .cse26 .cse13) (+ (select .cse26 .cse12) 1)))))) (or .cse0 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse27 (select .cse28 c_~A~0.base))) (< (select .cse27 .cse13) (+ (select .cse27 .cse12) 1))) (let ((.cse29 (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse29 .cse24) (+ (select .cse29 .cse23) 1))))))))) (or .cse3 .cse6 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse30 (select .cse31 c_~A~0.base))) (< (select .cse30 .cse12) (select .cse30 .cse13))) (let ((.cse32 (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse32 .cse24) (+ (select .cse32 .cse23) 1)))))) .cse4)) .cse14 .cse5) (or .cse14 (let ((.cse36 (< c_~N~0 (+ 2 c_thread3Thread1of1ForFork1_~i~2)))) (and (or .cse3 (let ((.cse35 (* c_thread3Thread1of1ForFork1_~i~2 4))) (let ((.cse34 (select .cse11 (+ c_~A~0.offset .cse35))) (.cse33 (select .cse11 (+ c_~A~0.offset 4 .cse35)))) (and (or .cse18 .cse19 (< .cse33 (+ .cse34 1))) (or .cse5 (< .cse34 .cse33))))) .cse36) (or .cse36 .cse1 .cse5)))) (or .cse14 (and .cse20 (or .cse3 .cse6 (let ((.cse38 (select .cse11 .cse24)) (.cse37 (select .cse11 .cse23))) (and (or .cse5 (< .cse37 .cse38)) (or .cse18 .cse19 (< .cse38 (+ .cse37 1)))))))) (or .cse14 .cse5 (let ((.cse40 (+ c_~A~0.offset 4))) (and (or .cse6 .cse1 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse39 .cse40) (+ (select .cse39 c_~A~0.offset) 1))))) (or .cse3 .cse6 .cse4 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse41 (select .cse42 c_~A~0.base))) (< (select .cse41 c_~A~0.offset) (select .cse41 .cse40))) (let ((.cse43 (select (store .cse42 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse43 .cse24) (+ (select .cse43 .cse23) 1))))))) (or .cse6 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse44 (select .cse45 c_~A~0.base))) (< (select .cse44 .cse40) (+ (select .cse44 c_~A~0.offset) 1))) (let ((.cse46 (select (store .cse45 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse46 .cse24) (+ (select .cse46 .cse23) 1)))))) .cse0) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse47 (select .cse48 c_~A~0.base))) (< (select .cse47 .cse40) (+ (select .cse47 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse49 (select (store .cse48 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse49 .cse23) (select .cse49 .cse24)))))))))))))))) is different from false [2023-11-17 16:25:09,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse33 (mod c_~sorted1~0 256)) (.cse4 (= (mod c_~sorted2~0 256) 0))) (let ((.cse32 (* 4 c_~M~0)) (.cse0 (not .cse4)) (.cse2 (= .cse33 1)) (.cse16 (< c_~N~0 (+ 2 c_~M~0))) (.cse1 (not .cse3)) (.cse5 (= .cse33 0))) (let ((.cse17 (or .cse16 .cse1 .cse5)) (.cse10 (and .cse5 .cse4)) (.cse11 (and .cse0 .cse2)) (.cse9 (< 0 c_~M~0)) (.cse14 (+ c_~A~0.offset .cse32)) (.cse13 (+ c_~A~0.offset .cse32 4))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0) (and .cse0 .cse1 .cse2) (and (or .cse3 .cse4) .cse5)) (= c_~sorted2~0 1) (let ((.cse7 (= c_~sorted3~0 1)) (.cse8 (= 1 c_~sorted1~0))) (or (let ((.cse6 (not (= 0 c_~M~0)))) (and (or (= c_~sorted3~0 0) (and .cse6 .cse7)) (or (= 0 c_~sorted1~0) (and .cse6 .cse8)))) (and .cse7 .cse8))) (<= 0 c_~M~0) (or .cse9 (and (or .cse3 (and (or .cse10 .cse11 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse12 .cse13) (+ (select .cse12 .cse14) 1))))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse15 .cse14) (select .cse15 .cse13)))) .cse5)) .cse16) .cse17)) (or .cse9 (and .cse17 (or .cse3 .cse16 (let ((.cse20 (select |c_#memory_int| c_~A~0.base))) (let ((.cse19 (select .cse20 .cse13)) (.cse18 (select .cse20 .cse14))) (and (or .cse5 (< .cse18 .cse19)) (or .cse10 .cse11 (< .cse19 (+ .cse18 1))))))))) (or .cse9 .cse5 (let ((.cse22 (+ c_~A~0.offset 4))) (and (or .cse16 .cse1 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse21 .cse22) (+ (select .cse21 c_~A~0.offset) 1))))) (or .cse3 .cse16 .cse4 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse23 (select .cse24 c_~A~0.base))) (< (select .cse23 c_~A~0.offset) (select .cse23 .cse22))) (let ((.cse25 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse25 .cse13) (+ (select .cse25 .cse14) 1))))))) (or .cse16 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse26 (select .cse27 c_~A~0.base))) (< (select .cse26 .cse22) (+ (select .cse26 c_~A~0.offset) 1))) (let ((.cse28 (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse28 .cse13) (+ (select .cse28 .cse14) 1)))))) .cse0) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse29 (select .cse30 c_~A~0.base))) (< (select .cse29 .cse22) (+ (select .cse29 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse31 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse31 .cse14) (select .cse31 .cse13)))))))))))))))) is different from false [2023-11-17 16:25:16,408 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse36 (mod c_~sorted1~0 256)) (.cse4 (= (mod c_~sorted3~0 256) 0)) (.cse24 (= (mod c_~sorted2~0 256) 0))) (let ((.cse35 (* 4 c_~M~0)) (.cse31 (not .cse24)) (.cse12 (< c_~N~0 (+ 2 c_~M~0))) (.cse19 (not .cse4)) (.cse11 (= .cse36 0))) (let ((.cse1 (div c_~sorted1~0 256)) (.cse13 (or .cse12 .cse19 .cse11)) (.cse5 (and .cse11 .cse24)) (.cse6 (and .cse31 (= .cse36 1))) (.cse16 (select |c_#memory_int| c_~A~0.base)) (.cse3 (< 0 c_~M~0)) (.cse9 (+ c_~A~0.offset .cse35)) (.cse8 (+ c_~A~0.offset .cse35 4))) (and (let ((.cse2 (div c_~sorted3~0 256))) (or (let ((.cse0 (= c_~sorted3~0 (* 256 .cse2)))) (and (or (< 0 c_~sorted1~0) .cse0) (or (< c_~sorted1~0 1) (and (not .cse0) (= 1 c_~sorted1~0))) (= .cse1 0))) (and (= (+ (* .cse1 256) 1) c_~sorted1~0) (<= .cse2 0) (<= 1 c_~sorted3~0)))) (= c_~sorted2~0 1) (<= .cse1 0) (or .cse3 (and (or .cse4 (and (or .cse5 .cse6 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse7 .cse8) (+ (select .cse7 .cse9) 1))))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse10 .cse9) (select .cse10 .cse8)))) .cse11)) .cse12) .cse13)) (or .cse3 (let ((.cse18 (< c_~N~0 (+ 2 c_thread3Thread1of1ForFork1_~i~2)))) (and (or .cse4 (let ((.cse17 (* c_thread3Thread1of1ForFork1_~i~2 4))) (let ((.cse15 (select .cse16 (+ c_~A~0.offset .cse17))) (.cse14 (select .cse16 (+ c_~A~0.offset 4 .cse17)))) (and (or .cse5 .cse6 (< .cse14 (+ .cse15 1))) (or .cse11 (< .cse15 .cse14))))) .cse18) (or .cse18 .cse19 .cse11)))) (or .cse3 (and .cse13 (or .cse4 .cse12 (let ((.cse21 (select .cse16 .cse8)) (.cse20 (select .cse16 .cse9))) (and (or .cse11 (< .cse20 .cse21)) (or .cse5 .cse6 (< .cse21 (+ .cse20 1)))))))) (or .cse3 .cse11 (let ((.cse23 (+ c_~A~0.offset 4))) (and (or .cse12 .cse19 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse22 .cse23) (+ (select .cse22 c_~A~0.offset) 1))))) (or .cse4 .cse12 .cse24 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse25 (select .cse26 c_~A~0.base))) (< (select .cse25 c_~A~0.offset) (select .cse25 .cse23))) (let ((.cse27 (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse27 .cse8) (+ (select .cse27 .cse9) 1))))))) (or .cse12 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse28 (select .cse29 c_~A~0.base))) (< (select .cse28 .cse23) (+ (select .cse28 c_~A~0.offset) 1))) (let ((.cse30 (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse30 .cse8) (+ (select .cse30 .cse9) 1)))))) .cse31) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse32 (select .cse33 c_~A~0.base))) (< (select .cse32 .cse23) (+ (select .cse32 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse34 (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse34 .cse9) (select .cse34 .cse8)))))))))))))))) is different from false [2023-11-17 16:25:19,680 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse30 (mod c_~sorted1~0 256)) (.cse4 (= (mod c_~sorted2~0 256) 0))) (let ((.cse29 (* 4 c_~M~0)) (.cse0 (not .cse4)) (.cse2 (= .cse30 1)) (.cse13 (< c_~N~0 (+ 2 c_~M~0))) (.cse1 (not .cse3)) (.cse5 (= .cse30 0))) (let ((.cse14 (or .cse13 .cse1 .cse5)) (.cse7 (and .cse5 .cse4)) (.cse8 (and .cse0 .cse2)) (.cse6 (< 0 c_~M~0)) (.cse11 (+ c_~A~0.offset .cse29)) (.cse10 (+ c_~A~0.offset .cse29 4))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0) (and .cse0 .cse1 .cse2) (and (or .cse3 .cse4) .cse5)) (or .cse6 (and (or .cse3 (and (or .cse7 .cse8 (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse9 .cse10) (+ (select .cse9 .cse11) 1))))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse12 .cse11) (select .cse12 .cse10)))) .cse5)) .cse13) .cse14)) (or .cse6 (and .cse14 (or .cse3 .cse13 (let ((.cse17 (select |c_#memory_int| c_~A~0.base))) (let ((.cse16 (select .cse17 .cse10)) (.cse15 (select .cse17 .cse11))) (and (or .cse5 (< .cse15 .cse16)) (or .cse7 .cse8 (< .cse16 (+ .cse15 1))))))))) (or .cse6 .cse5 (let ((.cse19 (+ c_~A~0.offset 4))) (and (or .cse13 .cse1 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse18 .cse19) (+ (select .cse18 c_~A~0.offset) 1))))) (or .cse3 .cse13 .cse4 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse20 (select .cse21 c_~A~0.base))) (< (select .cse20 c_~A~0.offset) (select .cse20 .cse19))) (let ((.cse22 (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse22 .cse10) (+ (select .cse22 .cse11) 1))))))) (or .cse13 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse23 (select .cse24 c_~A~0.base))) (< (select .cse23 .cse19) (+ (select .cse23 c_~A~0.offset) 1))) (let ((.cse25 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse25 .cse10) (+ (select .cse25 .cse11) 1)))))) .cse0) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse26 (select .cse27 c_~A~0.base))) (< (select .cse26 .cse19) (+ (select .cse26 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse28 (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse28 .cse11) (select .cse28 .cse10)))))))))))))))) is different from false [2023-11-17 16:25:23,596 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (* 4 c_~M~0)) (.cse4 (= (mod c_~sorted2~0 256) 0)) (.cse3 (= (mod c_~sorted3~0 256) 0)) (.cse24 (mod c_~sorted1~0 256))) (let ((.cse2 (= .cse24 1)) (.cse6 (< 0 c_~M~0)) (.cse5 (= .cse24 0)) (.cse1 (not .cse3)) (.cse11 (< c_~N~0 (+ 2 c_~M~0))) (.cse0 (not .cse4)) (.cse9 (+ c_~A~0.offset .cse23)) (.cse8 (+ c_~A~0.offset .cse23 4))) (and (or (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0) (and .cse0 .cse1 .cse2) (and (or .cse3 .cse4) .cse5)) (or .cse6 (and (or .cse3 (and (or (and .cse5 .cse4) (and .cse0 .cse2) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse7 .cse8) (+ (select .cse7 .cse9) 1))))) (or (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse10 .cse9) (select .cse10 .cse8)))) .cse5)) .cse11) (or .cse11 .cse1 .cse5))) (or .cse6 .cse5 (let ((.cse13 (+ c_~A~0.offset 4))) (and (or .cse11 .cse1 (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489) c_~A~0.base))) (< (select .cse12 .cse13) (+ (select .cse12 c_~A~0.offset) 1))))) (or .cse3 .cse11 .cse4 (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse14 (select .cse15 c_~A~0.base))) (< (select .cse14 c_~A~0.offset) (select .cse14 .cse13))) (let ((.cse16 (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse16 .cse8) (+ (select .cse16 .cse9) 1))))))) (or .cse11 (and (or (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse17 (select .cse18 c_~A~0.base))) (< (select .cse17 .cse13) (+ (select .cse17 c_~A~0.offset) 1))) (let ((.cse19 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse19 .cse8) (+ (select .cse19 .cse9) 1)))))) .cse0) (forall ((v_ArrVal_489 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_489))) (or (let ((.cse20 (select .cse21 c_~A~0.base))) (< (select .cse20 .cse13) (+ (select .cse20 c_~A~0.offset) 1))) (forall ((v_ArrVal_490 (Array Int Int))) (let ((.cse22 (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_490) c_~A~0.base))) (< (select .cse22 .cse9) (select .cse22 .cse8))))))))))))))) is different from false [2023-11-17 16:25:43,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:54,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:58,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:59,143 INFO L124 PetriNetUnfolderBase]: 31232/43429 cut-off events. [2023-11-17 16:25:59,143 INFO L125 PetriNetUnfolderBase]: For 600237/600237 co-relation queries the response was YES. [2023-11-17 16:25:59,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309068 conditions, 43429 events. 31232/43429 cut-off events. For 600237/600237 co-relation queries the response was YES. Maximal size of possible extension queue 1386. Compared 257804 event pairs, 1055 based on Foata normal form. 13/43432 useless extension candidates. Maximal degree in co-relation 308972. Up to 14022 conditions per place. [2023-11-17 16:25:59,814 INFO L140 encePairwiseOnDemand]: 347/373 looper letters, 2045 selfloop transitions, 4407 changer transitions 22/6474 dead transitions. [2023-11-17 16:25:59,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 6474 transitions, 101390 flow [2023-11-17 16:25:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2023-11-17 16:25:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2023-11-17 16:25:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 24097 transitions. [2023-11-17 16:25:59,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28840721945614706 [2023-11-17 16:25:59,857 INFO L72 ComplementDD]: Start complementDD. Operand 224 states and 24097 transitions. [2023-11-17 16:25:59,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 24097 transitions. [2023-11-17 16:25:59,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:25:59,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 224 states and 24097 transitions. [2023-11-17 16:25:59,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 225 states, 224 states have (on average 107.57589285714286) internal successors, (24097), 224 states have internal predecessors, (24097), 0 states have call successors, (0), 0 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:26:00,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 225 states, 225 states have (on average 373.0) internal successors, (83925), 225 states have internal predecessors, (83925), 0 states have call successors, (0), 0 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:26:00,288 INFO L81 ComplementDD]: Finished complementDD. Result has 225 states, 225 states have (on average 373.0) internal successors, (83925), 225 states have internal predecessors, (83925), 0 states have call successors, (0), 0 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:26:00,288 INFO L175 Difference]: Start difference. First operand has 197 places, 723 transitions, 10364 flow. Second operand 224 states and 24097 transitions. [2023-11-17 16:26:00,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 6474 transitions, 101390 flow [2023-11-17 16:26:10,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 6474 transitions, 99974 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 16:26:10,483 INFO L231 Difference]: Finished difference. Result has 579 places, 5214 transitions, 93996 flow [2023-11-17 16:26:10,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=10194, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=540, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=224, PETRI_FLOW=93996, PETRI_PLACES=579, PETRI_TRANSITIONS=5214} [2023-11-17 16:26:10,484 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 547 predicate places. [2023-11-17 16:26:10,484 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 5214 transitions, 93996 flow [2023-11-17 16:26:10,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 99.875) internal successors, (3995), 40 states have internal predecessors, (3995), 0 states have call successors, (0), 0 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:26:10,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:26:10,485 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:26:10,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-17 16:26:10,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-17 16:26:10,686 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:26:10,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:26:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1207251315, now seen corresponding path program 3 times [2023-11-17 16:26:10,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:26:10,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759947070] [2023-11-17 16:26:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:26:10,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:26:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:26:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:26:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759947070] [2023-11-17 16:26:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759947070] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:26:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907292395] [2023-11-17 16:26:12,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:26:12,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:26:12,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:26:12,215 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:26:12,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-17 16:26:12,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:26:12,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:26:12,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-17 16:26:12,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:26:12,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:26:12,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2023-11-17 16:26:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:12,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:26:13,868 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2023-11-17 16:26:13,869 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 43 treesize of output 32 [2023-11-17 16:26:13,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:26:13,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 159 [2023-11-17 16:26:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907292395] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:26:16,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:26:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 31 [2023-11-17 16:26:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666696756] [2023-11-17 16:26:16,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:26:16,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 16:26:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:26:16,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 16:26:16,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2023-11-17 16:26:16,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 373 [2023-11-17 16:26:16,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 5214 transitions, 93996 flow. Second operand has 33 states, 33 states have (on average 96.27272727272727) internal successors, (3177), 33 states have internal predecessors, (3177), 0 states have call successors, (0), 0 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:26:16,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:26:16,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 373 [2023-11-17 16:26:16,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-17 16:30:18,165 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 16:30:18,201 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 16:30:19,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-17 16:30:19,365 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-17 16:30:19,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown [2023-11-17 16:30:26,854 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 16:30:26,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 16:30:26,859 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-17 16:30:26,877 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 16:30:26,877 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 16:30:26,878 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 16:30:26,878 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1] [2023-11-17 16:30:26,883 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 16:30:26,883 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 16:30:26,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:30:26 BasicIcfg [2023-11-17 16:30:26,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 16:30:26,885 INFO L158 Benchmark]: Toolchain (without parser) took 381906.87ms. Allocated memory was 225.4MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 179.1MB in the beginning and 236.2MB in the end (delta: -57.2MB). Peak memory consumption was 6.2GB. Max. memory is 8.0GB. [2023-11-17 16:30:26,886 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 181.4MB. Free memory was 136.3MB in the beginning and 136.2MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:30:26,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.26ms. Allocated memory is still 225.4MB. Free memory was 179.1MB in the beginning and 167.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 16:30:26,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.82ms. Allocated memory is still 225.4MB. Free memory was 167.0MB in the beginning and 165.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 16:30:26,886 INFO L158 Benchmark]: Boogie Preprocessor took 49.60ms. Allocated memory is still 225.4MB. Free memory was 165.3MB in the beginning and 163.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:30:26,886 INFO L158 Benchmark]: RCFGBuilder took 559.66ms. Allocated memory is still 225.4MB. Free memory was 163.4MB in the beginning and 145.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-11-17 16:30:26,887 INFO L158 Benchmark]: TraceAbstraction took 381036.08ms. Allocated memory was 225.4MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 145.0MB in the beginning and 236.2MB in the end (delta: -91.3MB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. [2023-11-17 16:30:26,891 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 181.4MB. Free memory was 136.3MB in the beginning and 136.2MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.26ms. Allocated memory is still 225.4MB. Free memory was 179.1MB in the beginning and 167.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.82ms. Allocated memory is still 225.4MB. Free memory was 167.0MB in the beginning and 165.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.60ms. Allocated memory is still 225.4MB. Free memory was 165.3MB in the beginning and 163.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 559.66ms. Allocated memory is still 225.4MB. Free memory was 163.4MB in the beginning and 145.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 381036.08ms. Allocated memory was 225.4MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 145.0MB in the beginning and 236.2MB in the end (delta: -91.3MB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 171 PlacesBefore, 32 PlacesAfterwards, 176 TransitionsBefore, 28 TransitionsAfterwards, 4158 CoEnabledTransitionPairs, 8 FixpointIterations, 82 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 21 ConcurrentYvCompositions, 9 ChoiceCompositions, 183 TotalNumberOfCompositions, 4781 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4022, independent: 3972, independent conditional: 0, independent unconditional: 3972, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2937, independent: 2915, independent conditional: 0, independent unconditional: 2915, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2937, independent: 2915, independent conditional: 0, independent unconditional: 2915, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4022, independent: 1057, independent conditional: 0, independent unconditional: 1057, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 2937, unknown conditional: 0, unknown unconditional: 2937] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 236 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 380.9s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 352.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 468 mSolverCounterUnknown, 3529 SdHoareTripleChecker+Valid, 28.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3529 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 26.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6366 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 655 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19665 IncrementalHoareTripleChecker+Invalid, 27154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 655 mSolverCounterUnsat, 0 mSDtfsCounter, 19665 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1211 GetRequests, 460 SyntacticMatches, 17 SemanticMatches, 734 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 48669 ImplicationChecksByTransitivity, 81.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93996occurred in iteration=16, InterpolantAutomatonStates: 398, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 977 ConstructedInterpolants, 16 QuantifiedInterpolants, 12531 SizeOfPredicates, 78 NumberOfNonLiveVariables, 2987 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 43 InterpolantComputations, 8 PerfectInterpolantSequences, 71/158 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout !ENTRY org.eclipse.osgi 4 0 2023-11-17 16:30:26.940 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef6d8a4f/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:190) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef6d8a4f/.metadata/.log.